Cycle isolation in graphs (Q6906770)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8115061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycle isolation in graphs |
scientific article; zbMATH DE number 8115061 |
Statements
Cycle isolation in graphs (English)
0 references
4 November 2025
0 references
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.
0 references
cycle isolation number
0 references
\(\{C_k \}\)-isolation number
0 references
partial-domination
0 references
0 references
