Bondage number of planar graphs
type: Item
instance of: scholarly article
title: Bondage number of planar graphs
zbMATH Open document ID: 0961.05055
DOI: 10.1016/S0012-365X(99)00405-7
author: Jinjiang Yuan
author: Liying Kang
published in: Discrete Mathematics
publication date: 2001-05-28T00:00:00Z
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\).
reviewed by: Bohdan Zelinka
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1506827
zbMATH Keywords: dominating set
zbMATH Keywords: domination number
zbMATH Keywords: bondage number
zbMATH Keywords: planar graphs
zbMATH Keywords: forbidden minor
MaRDI profile type: Publication
full work available at URL: s0012-365x(99)00405-7
OpenAlex ID: W2036334548
description: scientific article; zbMATH DE number 1506827