Total domination and total domination subdivision number of a graph and its complement

DOI10.1016/j.disc.2007.07.088zbMath1169.05033OpenAlexW2073028422MaRDI QIDQ932661

Odile Favaron, Seyyed Mahmoud Sheikholeslami, Hossein Karami

Publication date: 11 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.088

zbMATH Keywords

total domination numbertotal domination subdivision numberNordhaus-Gaddum inequalities

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On the total domination subdivision number in some classes of graphs ⋮ Bounding the total domination subdivision number of a graph in terms of its order ⋮ Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs ⋮ Total Roman domination subdivision number in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the total domination subdivision number of a graph in terms of its order
• A note on Nordhaus-Gaddum inequalities for domination.
• Nordhaus-Gaddum inequalities for domination in graphs
• Total domination in graphs
• Effect of edge-subdivision on vertex-domination in a graph
• Domination Subdivision Numbers
• Total domination subdivision numbers of graphs

This page was built for publication: Total domination and total domination subdivision number of a graph and its complement