Bondage number of planar graphs (Q1579562): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1598802 |
Changed an Item |
||
Property / author | |||
Property / author: Li-ying Kang / rank | |||
Normal rank |
Revision as of 18:50, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bondage number of planar graphs |
scientific article |
Statements
Bondage number of planar graphs (English)
0 references
28 May 2001
0 references
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\).
0 references
dominating set
0 references
domination number
0 references
bondage number
0 references
planar graphs
0 references
forbidden minor
0 references