Independent domination in graphs: A survey and recent results

Wayne Goddard; Michael A. Henning

doi:10.1016/j.disc.2012.11.031

Independent domination in graphs: A survey and recent results

Wayne Goddard
, Michael A. Henning

Mathematics and Applied Mathematics

Clemson University College of Engineering, Computing and Applied Sciences

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

225 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 offer a survey of selected recent results on independent domination in graphs.

Original language	English
Pages (from-to)	839-854
Number of pages	16
Journal	Discrete Mathematics
Volume	313
Issue number	7
DOIs	https://doi.org/10.1016/j.disc.2012.11.031
Publication status	Published - 6 Apr 2013

Keywords

Independent dominating

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2012.11.031

Cite this

@article{06c74b9756d848a2a8bec8ed7411408b,

title = "Independent domination in graphs: A survey and recent results",

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 offer a survey of selected recent results on independent domination in graphs.",

keywords = "Independent dominating",

author = "Wayne Goddard and Henning, \{Michael A.\}",

year = "2013",

month = apr,

day = "6",

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

language = "English",

volume = "313",

pages = "839--854",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "7",

}

TY - JOUR

T1 - Independent domination in graphs

T2 - A survey and recent results

AU - Goddard, Wayne

AU - Henning, Michael A.

PY - 2013/4/6

Y1 - 2013/4/6

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 offer a survey of selected recent results on independent domination in 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 offer a survey of selected recent results on independent domination in graphs.

KW - Independent dominating

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

U2 - 10.1016/j.disc.2012.11.031

DO - 10.1016/j.disc.2012.11.031

M3 - Article

AN - SCOPUS:84893645759

SN - 0012-365X

VL - 313

SP - 839

EP - 854

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 7

ER -

Independent domination in graphs: A survey and recent results

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this