The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs

DOI10.1007/978-3-319-26626-8_48zbMath1478.05114OpenAlexW2408489498MaRDI QIDQ3467878

Eunjeong Yi

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_48

zbMATH Keywords

pathscyclestreesPetersen graphCartesian product graphscomplete multipartite graphsdisjunctive total dominationdisjunctive dominationdisjunctive bondage numberdisjunctive total bondage number

Mathematics Subject Classification ID

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

Related Items (1)

Complexity and bounds for disjunctive total bondage

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• On the complexity of the bondage and reinforcement problems
• Domination alteration sets in graphs
• A survey of selected recent results on total domination in graphs
• The bondage number of a graph
• On bondage numbers of graphs: a survey with some comments
• Domination versus disjunctive domination in trees
• The disjunctive domination number of a graph

This page was built for publication: The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs