Domination parameters and edge-removal-critical graphs
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.
scientific article; zbMATH DE number 1619841