Back to Search
Start Over
Induced Cycles in Graphs.
- Source :
-
Graphs & Combinatorics . Nov2016, Vol. 32 Issue 6, p2425-2441. 17p. - Publication Year :
- 2016
-
Abstract
- The maximum number vertices of a graph G inducing a 2-regular subgraph of G is denoted by $$c_\mathrm{ind}(G)$$ . We prove that if G is an r-regular graph of order n, then $$c_\mathrm{ind}(G) \ge \frac{n}{2(r-1)} + \frac{1}{(r-1)(r-2)}$$ and we prove that if G is a cubic, claw-free graph on order n, then $$c_\mathrm{ind}(G) > \frac{13}{20}n$$ and this bound is asymptotically best possible. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 32
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 119060557
- Full Text :
- https://doi.org/10.1007/s00373-016-1713-z