Back to Search Start Over

Properties of total domination edge-critical graphs

Authors :
Michael A. Henning
Lucas C. van der Merwe
Source :
Discrete Applied Mathematics. 158:147-153
Publication Year :
2010
Publisher :
Elsevier BV, 2010.

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 @c"t(G) of G. The graph G is total domination edge critical if for every edge e in the complement of G, @c"t(G+e)

Subjects

Subjects :
Discrete mathematics
Total domination
Edge critical
Critical graph
Domination analysis
Applied Mathematics
TEC
Neighbourhood (graph theory)
Graph
Vertex (geometry)
Combinatorics
Diameter
Bounds
Dominating set
Discrete Mathematics and Combinatorics
Bound graph
Mathematics

Details

ISSN :
0166218X
Volume :
158
Database :
OpenAIRE
Journal :
Discrete Applied Mathematics
Accession number :
edsair.doi.dedup.....ee1deaf35c939a33e43730fb37f3c10a
Full Text :
https://doi.org/10.1016/j.dam.2009.09.004
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details