The bondage and connectivity of a graph
From MaRDI portal
Publication:1869225
DOI10.1016/S0012-365X(02)00770-7zbMath1014.05050OpenAlexW2063541661MaRDI QIDQ1869225
Publication date: 9 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00770-7
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (9)
The \(k\)-rainbow bondage number of a graph ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of grid graphs ⋮ The \(p\)-bondage number of trees ⋮ The total bondage number of grid graphs ⋮ Non-isolating bondage in graphs ⋮ Paired bondage in trees ⋮ 2-bondage in graphs
This page was built for publication: The bondage and connectivity of a graph