Maximum sizes of graphs with given domination parameters

Peter Dankelmann; Gayla S. Domke; Wayne Goddard; Paul Grobler; Johannes H. Hattingh; Henda C. Swart

doi:10.1016/j.disc.2003.07.010

Maximum sizes of graphs with given domination parameters

Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul Grobler, Johannes H. Hattingh, Henda C. Swart

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

18 Citations (Scopus)

Abstract

We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers.

Original language	English
Pages (from-to)	137-148
Number of pages	12
Journal	Discrete Mathematics
Volume	281
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2003.07.010
Publication status	Published - 28 Apr 2004
Externally published	Yes

Keywords

Bipartite
Domination
Edges
Extremal graph
Size

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2003.07.010

Cite this

@article{5c4917e0676c40fca5921e3555bbc7b2,

title = "Maximum sizes of graphs with given domination parameters",

abstract = "We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers.",

keywords = "Bipartite, Domination, Edges, Extremal graph, Size",

author = "Peter Dankelmann and Domke, \{Gayla S.\} and Wayne Goddard and Paul Grobler and Hattingh, \{Johannes H.\} and Swart, \{Henda C.\}",

year = "2004",

month = apr,

day = "28",

doi = "10.1016/j.disc.2003.07.010",

language = "English",

volume = "281",

pages = "137--148",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Maximum sizes of graphs with given domination parameters

AU - Dankelmann, Peter

AU - Domke, Gayla S.

AU - Goddard, Wayne

AU - Grobler, Paul

AU - Hattingh, Johannes H.

AU - Swart, Henda C.

PY - 2004/4/28

Y1 - 2004/4/28

N2 - We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers.

AB - We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers.

KW - Bipartite

KW - Domination

KW - Edges

KW - Extremal graph

KW - Size

UR - https://www.scopus.com/pages/publications/1842616015

U2 - 10.1016/j.disc.2003.07.010

DO - 10.1016/j.disc.2003.07.010

M3 - Article

AN - SCOPUS:1842616015

SN - 0012-365X

VL - 281

SP - 137

EP - 148

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Maximum sizes of graphs with given domination parameters

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this