Domination parameters and edge-removal-critical graphs
type: Item
instance of: scholarly article
title: Domination parameters and edge-removal-critical graphs
zbMATH Open document ID: 0973.05056
DOI: 10.1016/S0012-365X(00)00319-8
author: P. J. P. Grobler
author: Christina M. Mynhardt
published in: Discrete Mathematics
publication date: 2001-11-28T00:00:00Z
review text: If some graph parameter \(\pi\) increases (decreases) whenever an edge is removed from a graph, then the graph is called \(\pi\)-ER-critical (\(\pi^-\)-ER-critical). The authors first study the six classical domination parameters ir, \(\gamma\), \(i\), \(\beta\), \(\Gamma\) and IR for some special classes of graphs. Using these results, they give examples of classes of non-complete \(\pi\)-ER-critical graphs for \(\pi\in \{ \beta,\Gamma, \text{IR}\}\). Then they provide necessary conditions related to an ir-set of a graph \(G\) such that \(G\) is ir-ER-critical but not \(\gamma\)-ER-critical and they characterize ir-ER-critical graphs for ir=2. Again using their results on special graphs they finally provide classes of \(i^-\)-ER-critical graphs.
reviewed by: Dieter Rautenbach
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 1619841
zbMATH Keywords: edge-removal critical
zbMATH Keywords: domination
zbMATH Keywords: irredundance
zbMATH Keywords: independence
MaRDI profile type: MaRDI publication profile
full work available at URL: s0012-365x(00)00319-8
OpenAlex ID: W1975249093
Recommended article: Q4504902
Recommended article: On \(i\)-minus-edge-removal-critical graphs
Recommended article: On \(i^{-}\)-ER-critical graphs
Recommended article: Q3642400
Recommended article: Secure domination critical graphs
description: scientific article; zbMATH DE number 1619841