On the Independent Domination Number of Regular Graphs

Wayne Goddard; Michael A. Henning; Jeremy Lyle; Justin Southey

doi:10.1007/s00026-012-0155-4

On the Independent Domination Number of Regular Graphs

Wayne Goddard, Michael A. Henning, Jeremy Lyle, Justin Southey

Mathematics and Applied Mathematics

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

33 Citations (Scopus)

Abstract

A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.

Original language	English
Pages (from-to)	719-732
Number of pages	14
Journal	Annals of Combinatorics
Volume	16
Issue number	4
DOIs	https://doi.org/10.1007/s00026-012-0155-4
Publication status	Published - Dec 2012

Keywords

cubic graph
dominating set
independent domination
regular graph

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00026-012-0155-4

Cite this

@article{09731d96deda4c998bf288a5ef20c797,

title = "On the Independent Domination Number of Regular Graphs",

abstract = "A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.",

keywords = "cubic graph, dominating set, independent domination, regular graph",

author = "Wayne Goddard and Henning, {Michael A.} and Jeremy Lyle and Justin Southey",

year = "2012",

month = dec,

doi = "10.1007/s00026-012-0155-4",

language = "English",

volume = "16",

pages = "719--732",

journal = "Annals of Combinatorics",

issn = "0218-0006",

publisher = "Birkhauser Verlag Basel",

number = "4",

}

TY - JOUR

T1 - On the Independent Domination Number of Regular Graphs

AU - Goddard, Wayne

AU - Henning, Michael A.

AU - Lyle, Jeremy

AU - Southey, Justin

PY - 2012/12

Y1 - 2012/12

N2 - A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.

AB - A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.

KW - cubic graph

KW - dominating set

KW - independent domination

KW - regular graph

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

U2 - 10.1007/s00026-012-0155-4

DO - 10.1007/s00026-012-0155-4

M3 - Article

AN - SCOPUS:84870372742

SN - 0218-0006

VL - 16

SP - 719

EP - 732

JO - Annals of Combinatorics

JF - Annals of Combinatorics

IS - 4

ER -

On the Independent Domination Number of Regular Graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this