𝔖 Bobbio Scriptorium
✦   LIBER   ✦

k-Cycle resonant graphs

✍ Scribed by Xiaofeng Guo; Fuji Zhang

Book ID
103058506
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
492 KB
Volume
135
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A connected graph G is said to be k-cycle resonant if, for 1 < t < k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of the t cycles is an M-alternating cycle. In this paper, we at the first time introduce the concept of k-cycle resonant graphs, and investigate some properties of k-cycle resonant graphs. Some simple necessary and sufficient conditions for a graph to be k-cycle resonant are given. The construction of k-cycle resonant hexagonal systems are also characterized.

πŸ“œ SIMILAR VOLUMES

Planar k-cycle resonant graphs with k=1,
Planar k-cycle resonant graphs with k=1,2
✍ Xiaofeng Guo; Fuji Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 200 KB

A connected graph is said to be k-cycle resonant if, for 1 6 t 6 k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of the t cycles is an M -alternating cycle. The concept of k-cycle resonant graphs was introduced by the present authors in

On k -Resonant Fullerene Graphs
On k -Resonant Fullerene Graphs
✍ Ye, Dong; Qi, Zhongbin; Zhang, Heping πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 447 KB
Graphs with k odd cycle lengths
Graphs with k odd cycle lengths
✍ A. GyΓ‘rfΓ‘s πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 481 KB

Gyarf&, A., Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41-48. If G is a graph with k z 1 odd cycle lengths then each block of G is either KZk+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k + 2. For a graph G let L(G) deno