The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs
From MaRDI portal
Publication:3467878
DOI10.1007/978-3-319-26626-8_48zbMath1478.05114MaRDI QIDQ3467878
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
paths; cycles; trees; Petersen graph; Cartesian product graphs; complete multipartite graphs; disjunctive total domination; disjunctive domination; disjunctive bondage number; disjunctive total bondage number
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
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