An upper bound for the total domination subdivision number of a graph

DOI10.1007/s00373-010-0877-1zbMath1205.05169OpenAlexW2023962613MaRDI QIDQ968208

Abdollah Khodkar, Seyyed Mahmoud Sheikholeslami, Hossein Karami, Rana Khoeilar

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0877-1

zbMATH Keywords

total domination numbertotal domination subdivision number

Mathematics Subject Classification ID

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

Related Items (2)

On the total domination subdivision numbers in graphs ⋮ Bounding the total domination subdivision number of a graph in terms of its order

Cites Work

• Bounding the total domination subdivision number of a graph in terms of its order
• Disproof of a conjecture on the subdivision domination number of a graph
• A new bound on the total domination subdivision number
• Total domination subdivision numbers of graphs
• Hidden superconformal symmetry in M-theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound for the total domination subdivision number of a graph