Maximum sizes of graphs with given restrained domination numbers

Ernst J. Joubert

doi:10.1016/j.dam.2012.10.004

Maximum sizes of graphs with given restrained domination numbers

Ernst J. Joubert

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

Let G=(V,E) be a graph. A set S⊂V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γ_r(G), is the smallest cardinality of a restrained dominating set of G. In this paper we will bound the size of a graph G, given the restrained domination number of G.

Original language	English
Pages (from-to)	829-837
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	161
Issue number	6
DOIs	https://doi.org/10.1016/j.dam.2012.10.004
Publication status	Published - 2013

Keywords

Domination
Graph
Order
Restrained domination
Size

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2012.10.004

Cite this

@article{887634ffcee340a09aefbf825065a2b8,

title = "Maximum sizes of graphs with given restrained domination numbers",

abstract = "Let G=(V,E) be a graph. A set S⊂V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. In this paper we will bound the size of a graph G, given the restrained domination number of G.",

keywords = "Domination, Graph, Order, Restrained domination, Size",

author = "Joubert, {Ernst J.}",

year = "2013",

doi = "10.1016/j.dam.2012.10.004",

language = "English",

volume = "161",

pages = "829--837",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Maximum sizes of graphs with given restrained domination numbers

AU - Joubert, Ernst J.

PY - 2013

Y1 - 2013

N2 - Let G=(V,E) be a graph. A set S⊂V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. In this paper we will bound the size of a graph G, given the restrained domination number of G.

AB - Let G=(V,E) be a graph. A set S⊂V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. In this paper we will bound the size of a graph G, given the restrained domination number of G.

KW - Domination

KW - Graph

KW - Order

KW - Restrained domination

KW - Size

UR - http://www.scopus.com/inward/record.url?scp=84875472076&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2012.10.004

DO - 10.1016/j.dam.2012.10.004

M3 - Article

AN - SCOPUS:84875472076

SN - 0166-218X

VL - 161

SP - 829

EP - 837

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 6

ER -

Maximum sizes of graphs with given restrained domination numbers

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this