Non-isolating 2-bondage in graphs

DOI10.2969/jmsj/06510037zbMath1261.05078OpenAlexW2038144807MaRDI QIDQ1946849

Marcin Krzywkowski

Publication date: 9 April 2013

Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jmsj/1359036448

zbMATH Keywords

2-dominationbondagenon-isolating 2-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 ⋮ On the complexity of multiple bondage in graphs

Cites Work

• Paired bondage in trees
• 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
• Bondage number of planar graphs
• The bondage and connectivity of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-isolating 2-bondage in graphs