Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The bondage and connectivity of a graph

From MaRDI portal
Publication:1869225
Jump to:navigation, search

DOI10.1016/S0012-365X(02)00770-7zbMath1014.05050OpenAlexW2063541661MaRDI QIDQ1869225

Hailong Liu, Liang Sun

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


zbMATH Keywords

domination numberbondage number


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1869225&oldid=14258724"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki