Cycle isolation in graphs
From MaRDI portal
This paper studies the cycle isolation number of graphs and shows that several earlier conjectures relating this parameter to girth and graph size are false by providing explicit counterexamples. The authors further establish sharp upper bounds for the cases of isolating \(C_5\) and \(C_6\), namely \(\iota(G, C_5) \le (m+1)/7\) and \(\iota(G, C_6) \le (m+1)/8\), where \(G\) is a connected graph of size \(m\) and prove that these bounds are tight through suitable constructions.
Cites work
- \( K_{1 , 2}\)-isolation in graphs
- A note on the cycle isolation number of graphs
- Admissible property of graphs in terms of independence number
- Admissible property of graphs in terms of radius
- Cycle isolation of graphs with small girth
- Extensions of the Art Gallery Theorem
- Graph theory
- Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
- Isolation number of maximal outerplanar graphs
- Isolation of \(k\)-cliques. II
- Isolation of cycles
- Isolation of squares in graphs
- On the cycle isolation number of triangle-free graphs
- Partial domination -- the isolation number of a graph
- Partial domination of maximal outerplanar graphs
Cited in
(3)
This page was built for publication: Cycle isolation in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906770)
