Bounding the total domination subdivision number of a graph in terms of its order

DOI10.1007/s10878-009-9224-yzbMath1213.90212MaRDI QIDQ630192

Odile Favaron, Hossein Karami, Seyyed Mahmoud Sheikholeslami

Publication date: 17 March 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9224-y

zbMATH Keywords

total domination number

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

On the total domination subdivision numbers in graphs, Total domination and total domination subdivision number of a graph and its complement, An upper bound for the total domination subdivision number of a graph, A new bound on the total domination subdivision number, The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle, TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination and total domination subdivision number of a graph and its complement
• An upper bound for the total domination subdivision number of a graph
• Disproof of a conjecture on the subdivision domination number of a graph
• Total domination subdivision numbers of trees
• Effect of edge-subdivision on vertex-domination in a graph
• Domination Subdivision Numbers
• Total domination subdivision numbers of graphs