Bondage number of planar graphs

DOI10.1016/S0012-365X(99)00405-7MaRDI QIDQ1579562zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Liying Kang

Publication date 28 May 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00405-7

zbMATH Keywords

bondage numberdominating setdomination numberforbidden minorplanar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the domination number \(\gamma(G)\) of \(G\). The minimum number of vertices whose deletion from \(G\) changes the value of \(\gamma(G)\) for a higher one, is the bondage number \(b(G)\) of \(G\). This number is studied for planar graphs in general and in particular for graphs with forbidden minor \(K_4\).

Recommendations

• Remarks on the bondage number of planar graphs
• On the bondage number of a graph
• Independent bondage number of planar graphs with minimum degree at least 3
• Bondage number of planar graphs without small cycles
• scientific article; zbMATH DE number 876673

Cited in

(26)

• Reinforcement numbers of digraphs
• Remarks on the bondage number of planar graphs
• Non-isolating 2-bondage in graphs
• On bondage numbers of graphs: a survey with some comments
• A note on the Roman bondage number of planar graphs
• Independent bondage number of a graph
• Bondage number of grid graphs
• On the bondage number of planar and directed graphs
• Independent bondage number of planar graphs with minimum degree at least 3
• 2-bondage in graphs
• A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
• Upper bounds for the bondage number of graphs on topological surfaces
• An improved upper bound for the bondage number of graphs on surfaces
• Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
• Upper bounds on the bondage number of a graph
• Bondage number of planar graphs without small cycles
• The structure and the bondage number of three classes of beyond-planar graphs
• The \(p\)-bondage number of trees
• On the Roman bondage number of planar graphs
• Independent k -rainbow bondage number of graphs
• Bondage number of mesh networks
• The total bondage number of grid graphs
• Non-isolating bondage in graphs
• Bondage numbers of Mycielski graphs
• The bondage numbers of graphs with small crossing numbers
• Paired bondage in trees

This page was built for publication: Bondage number of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579562)