Paired bondage in trees

DOI10.1016/J.DISC.2007.10.010zbMath1161.05022OpenAlexW2074487881MaRDI QIDQ998438

Joanna Raczek

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.010

zbMATH Keywords

treesbondage numberpaired domination number

Mathematics Subject Classification ID

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

Related Items (9)

Total restrained bondage in graphs ⋮ Complexity and bounds for disjunctive total bondage ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The \(p\)-bondage number of trees ⋮ NP-hardness of multiple bondage in graphs ⋮ Bondage number of mesh networks ⋮ Some progress on total bondage in graphs ⋮ 2-bondage in graphs

Cites Work

• Paired-domination in claw-free cubic graphs
• The bondage number of a graph
• Bondage number of planar graphs
• Paired-domination of trees
• The bondage and connectivity of a graph
• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paired bondage in trees