Name
Abstract | ||
|---|---|---|
A dominating set in a graph G is a set S of vertices such that every vertex in V(G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.7151/dmgt.2002 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
domination,complement,total domination,connected domination,clique domination,restrained domination | Connected domination,Graph,Discrete mathematics,Comparability graph,Combinatorics,Graph property,Simplex graph,Null graph,Factor-critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 1 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wyatt J. Desormeaux | 1 | 44 | 8.26 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Michael A. Henning | 3 | 1865 | 246.94 |