Total bondage number of a graph
From MaRDI portal
Publication:2474670
zbMath1135.05056MaRDI QIDQ2474670
V. S. A. Subramanian, M. D. Elias, N. S. Sridharan
Publication date: 6 March 2008
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
05C05: Trees
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Quasi-total Roman bondage number in graphs, On the complexity of the bondage and reinforcement problems, NP-hardness of multiple bondage in graphs, The total bondage number of grid graphs, On bondage numbers of graphs: a survey with some comments, Some progress on total bondage in graphs, The total bondage numbers and efficient total dominations of vertex-transitive graphs, The algorithmic complexity of bondage and reinforcement problems in bipartite graphs, Complexity and bounds for disjunctive total bondage