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

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

Seyyed Mahmoud Sheikholeslami, Odile Favaron, Hossein Karami

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

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (9)

On the total domination subdivision numbers in graphs ⋮ On two conjectures concerning total domination subdivision number in graphs ⋮ The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle ⋮ 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 ⋮ On a conjecture concerning total domination subdivision number in graphs ⋮ TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS ⋮ Total Roman domination subdivision number in graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the total domination subdivision number of a graph in terms of its order