Some structures of 3-(_c, 2)-critical graphs which are not 3-_c-critical
The smallest cardinality of a connected dominating set in a graph \(G\) is called the connected domination number of \(G\) and is denoted by \(\gamma_c(G)\). If \(\gamma_c(G)=k\) and \(\gamma_c(G+uv) < k\) for every pair of non-adjacent vertices \(u\) and \(v\) of \(G\), then \(G\) is \(k\)-critical and if \(\gamma_c(G+uv) <k\) for every pair \(u, v\) of nonadjacent vertices with \(d(u,v) \leq t\), then \(G\) is \(k\)-(\(\gamma_c,t\))-critical. Let \(G\) be a \(3\)-(\(\gamma_c,2\))-critical graphs of diameter \(3\) which is not \(3\)-\(\gamma_c\)-critical and suppose \(u\) and \(z\) are vertices of \(G\) distance \(3\) apart such that \(\gamma_c(G+uz)=3\). Let \(V_i\), \(1 \leq i \leq 3\), be the vertices distance \(i\) from \(u\) in \(G\). The authors give characterizations of such graphs \(G\) when \(V_1\) is an independent set and the case where both \(V_1\) and \(V_2\) induce complete graphs.
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
- On the 3-_t-critical graphs of order (G)+3
- Characteristics of (,3)-critical graphs
- A note on 3-_t-critical k-regular graphs
- A characterization of 3-i-critical graphs of connectivity two
- On connected 3-\(\gamma_L\)-dot-critical graphs
- On critical 3-connected graphs with two vertices of degree 3. II
- scientific article; zbMATH DE number 861424
- On critical 3-connected graphs with two vertices of degree 3. I
- Some results on the independence number of connected domination critical graphs
- Connected domination critical graphs.
- A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
- Codiameters of 3-connected 3-domination critical graphs
- The diameter of connected domination critical graphs.
- The spectrum of dihedral quadruoke systems
- On the structure of graphs vertex critical with~respect to connected domination
- On local edge connected domination critical graphs
- A note on connected domination critical graphs
This page was built for publication: Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811688)
