Name
Abstract | ||
|---|---|---|
A set S of vertices in a graph G is a total dominating set of G 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 edge critical if the removal of any arbitrary edge increases the total domination number. On the other hand, a graph is total domination edge stable if the removal of any arbitrary edge has no effect on the total domination number. In this paper, we characterize total domination edge critical graphs. We also investigate various properties of total domination edge stable graphs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.dam.2010.06.003 | Discrete Applied Mathematics |
Keywords | Field | DocType |
various property,total domination edge stable,total domination number,edge removal,total domination edge,arbitrary edge,critical graph,graph g,minimum cardinality,stable graph,total domination edge critical,dominating set,domination number | Graph,Discrete mathematics,Combinatorics,Dominating set,Vertex (geometry),Edge cover,Cardinality,Independent set,Domination analysis,Critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
158 | 15 | Discrete Applied Mathematics |
Citations | PageRank | References |
6 | 0.53 | 10 |
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 |