Some progress on total bondage in graphs

DOI10.1007/s00373-013-1303-2zbMath1291.05149DBLPjournals/gc/RadR14OpenAlexW2064268947WikidataQ59397554 ScholiaQ59397554MaRDI QIDQ2014725

Joanna Raczek, Nader Jafari Rad

Publication date: 16 June 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1303-2

zbMATH Keywords

treedomination numbertotal dominationtotal bondage

Mathematics Subject Classification ID

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

Related Items (3)

On bondage numbers of graphs: a survey with some comments ⋮ NP-hardness of multiple bondage in graphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the bondage and reinforcement problems
• Domination alteration sets in graphs
• The \(p\)-bondage number of trees
• Paired bondage in trees
• A survey of selected recent results on total domination in graphs
• The bondage number of a graph
• Bounds on the bondage number of a graph
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• New results about the bondage number of a graph
• Total bondage number of a graph

This page was built for publication: Some progress on total bondage in graphs