ArticleOriginal scientific text
Title
Total domination edge critical graphs with maximum diameter
Authors 1, 1, 2
Affiliations
- University of South Africa, Pretoria, South Africa
- East Tennessee State University, Johnson City, TN 37614 USA
Abstract
Denote the total domination number of a graph G by γₜ(G). A graph G is said to be total domination edge critical, or simply γₜ-critical, if γₜ(G+e) < γₜ(G) for each edge e ∈ E(G̅). For 3ₜ-critical graphs G, that is, γₜ-critical graphs with γₜ(G) = 3, the diameter of G is either 2 or 3. We characterise the 3ₜ-critical graphs G with diam G = 3.
Bibliography
- E. Cockayne, R. Dawes and S. Hedetniemi, Total domination in graphs, Networks 10 (1980) 211-219, doi: 10.1002/net.3230100304.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, 1998).
- T.W. Haynes, C.M. Mynhardt and L.C. van der Merwe, Total domination edge critical graphs, Utilitas Math. 54 (1998) 229-240.
- T.W. Haynes, C.M. Mynhardt and L.C. van der Merwe, Criticality index of total domination, Congr. Numer. 131 (1998) 67-73.
- D.P. Sumner and P. Blitch, Domination critical graphs, J. Combin. Theory (B) 34 (1983) 65-76, doi: 10.1016/0095-8956(83)90007-2.
- D.P. Sumner and E. Wojcicka, Graphs critical with respect to the domination number, Domination in Graphs: Advanced Topics (Chapter 16), T.W. Haynes, S.T. Hedetniemi and P.J. Slater, eds. (Marcel Dekker, Inc., New York, 1998).
Pages:
187-205
Main language of publication
English
Received
2000-10-05
Published
2001
DOI: 10.7151/dmgt.1143
Exact and natural sciences