The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs

DOI10.1016/S0012-365X(97)00232-XzbMath0872.05022OpenAlexW2017030366MaRDI QIDQ1356465

Gayla S. Domke, Renu C. Laskar

Publication date: 7 October 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00232-x

zbMATH Keywords

bondage numberdominating functionreinforcement numberfractional domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (15)

Total restrained bondage in graphs ⋮ Total restrained reinforcement in graphs ⋮ On the complexity of reinforcement in graphs ⋮ The average lower reinforcement number of a graph ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ A note on total reinforcement in graphs ⋮ On domination and reinforcement numbers in trees ⋮ On the \(p\)-reinforcement and the complexity ⋮ Some progress on total bondage in graphs ⋮ Non-isolating bondage in graphs ⋮ Majority reinforcement number ⋮ Fractional Dominating Parameters ⋮ 2-bondage in graphs ⋮ The restrained k-rainbow reinforcement number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• The bondage number of a graph
• Domination critical graphs
• Domination critical graphs

This page was built for publication: The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs