Name
Abstract | ||
|---|---|---|
A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. A graph is total domination vertex removal stable if the removal of an arbitrary vertex leaves the total domination number unchanged. On the other hand, a graph is total domination vertex removal changing if the removal of an arbitrary vertex changes the total domination number. In this paper, we study total domination vertex removal changing and stable graphs. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2011.06.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
total domination number,arbitrary vertex change,vertex removal changing,vertex removal stable,total domination,graph g,arbitrary vertex,total domination vertex removal,minimum cardinality,stable graph,dominating set,domination number | Graph,Discrete mathematics,Dominating set,Combinatorics,Vertex (geometry),Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Cardinality,Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
159 | 15 | Discrete Applied Mathematics |
Citations | PageRank | References |
4 | 0.42 | 12 |
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 |