Restrained bondage in graphs

DOI10.1016/j.disc.2007.10.016zbMath1186.05091OpenAlexW2030319170MaRDI QIDQ998423

Andrew R. Plummer, Johannes H. Hattingh

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.016

zbMATH Keywords

restrained dominationbondage numberrestrained bondage

Mathematics Subject Classification ID

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

Related Items (10)

Upper bounds for domination related parameters in graphs on surfaces ⋮ Complexity and bounds for disjunctive total bondage ⋮ On the complexity of the bondage and reinforcement problems ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ The \(p\)-bondage number of trees ⋮ Bondage number of mesh networks ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ The total bondage number of grid graphs ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems

Cites Work

• Domination alteration sets in graphs
• The bondage number of a graph
• Graphs with large restrained domination number
• Restrained domination in graphs
• Bounds on the bondage number of a graph
• New results about the bondage number of a graph
• Restrained domination in trees
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Restrained bondage in graphs