JOURNAL ARTICLE

Cyclability of r-regular r-connected graphs

William McCuaigMoshe Rosenfeld

Year: 1984 Journal:   Bulletin of the Australian Mathematical Society Vol: 29 (1)Pages: 1-11   Publisher: Cambridge University Press

Abstract

For each value of r ≥ 4, r even, we construct infinitely many r -regular, r -connected graphs whose cyclability is not greater than 6 r − 4 if r = 0 (mod 4) and 8 r − 5 if r ≡ 2 (mod 4).

Keywords:
Mathematics Mod Combinatorics Discrete mathematics

Metrics

5
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.27
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Graph theory and applications
Physical Sciences →  Mathematics →  Geometry and Topology

Related Documents

JOURNAL ARTICLE

On r-regular r-connected non-hamiltonian graphs

Brad JacksonT. D. Parsons

Journal:   Bulletin of the Australian Mathematical Society Year: 1981 Vol: 24 (2)Pages: 205-220
JOURNAL ARTICLE

A shortness exponent for r‐regular r‐connected graphs

Brad JacksonT. D. Parsons

Journal:   Journal of Graph Theory Year: 1982 Vol: 6 (2)Pages: 169-176
JOURNAL ARTICLE

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs

Yulai MaDavide MattioloEckhard SteffenIsaak H. Wolf

Journal:   SIAM Journal on Discrete Mathematics Year: 2023 Vol: 37 (3)Pages: 1548-1565
JOURNAL ARTICLE

On r‐Connected Graphs with No Semi‐topological r‐Wheel

Elad Aigner‐HorevM. V. Lomonosov

Journal:   Journal of Graph Theory Year: 2012 Vol: 72 (3)Pages: 267-290
JOURNAL ARTICLE

Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs

Sebastian M. CioabăAndré KündgenCraig TimmonsVladislav Vysotsky

Journal:   Combinatorics Probability Computing Year: 2011 Vol: 20 (4)Pages: 519-527
© 2026 ScienceGate Book Chapters — All rights reserved.