The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle

DOI10.1007/s10878-011-9421-3zbMath1268.90115OpenAlexW1988379296MaRDI QIDQ1945693

Rana Khoeilar, Hossein Karami, Seyyed Mahmoud Sheikholeslami

Publication date: 8 April 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-011-9421-3

zbMATH Keywords

matchingbarriertotal domination numbertotal domination subdivision number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On the total domination subdivision number in some classes of graphs
• On the total domination subdivision numbers in graphs
• Bounding the total domination subdivision number of a graph in terms of its order
• A new bound on the total domination subdivision number
• Total domination subdivision numbers of trees
• Matchings and total domination subdivision number in graphs with few induced 4-cycles
• Total domination subdivision numbers of graphs
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle