Total domination dot-critical graphs

DOI10.1016/j.dam.2010.10.006zbMath1203.05118OpenAlexW2040226147MaRDI QIDQ617644

Michael A. Henning, Nader Jafari Rad

Publication date: 21 January 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.006

zbMATH Keywords

criticaltotal dominationdot-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Total domination dot-stable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination dot-critical graphs
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• Domination dot-critical graphs with no critical vertices
• A note on the domination dot-critical graphs
• Matching properties in total domination vertex critical graphs
• A survey of selected recent results on total domination in graphs
• A constructive characterization of total domination vertex critical graphs
• On total domination vertex critical graphs of high connectivity
• On the diameter of a domination dot-critical graph
• Vertices contained in all or in no minimum total dominating set of a tree
• The diameter of total domination vertex critical graphs
• On the diameter of dot-critical graphs
• Vertex domination-critical graphs
• Total domination in graphs
• Graphs with large total domination number

This page was built for publication: Total domination dot-critical graphs