Upper bounds on the paired domination subdivision number of a graph

DOI10.1007/s00373-012-1162-2zbMath1268.05148OpenAlexW1976691234MaRDI QIDQ354438

Yoshimi Egawa, Masanori Takatou, Michitaka Furuya

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1162-2

zbMATH Keywords

treeperfect matchingpaired domination numberpaired dominating setpaired domination subdivision number

Mathematics Subject Classification ID

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

Related Items (2)

Complexity of the paired domination subdivision problem ⋮ A proof of a conjecture on the paired-domination subdivision number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination subdivision numbers of graphs
• Paired-domination in graphs
• Domination Subdivision Numbers
• Total domination subdivision numbers of graphs

This page was built for publication: Upper bounds on the paired domination subdivision number of a graph