Planar k-cycle resonant graphs with k=1,2

AbstractA connected graph 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. The concept of k-cycle resonant graphs was introduced by the present authors in 1994. Some necessary and sufficient conditions for a graph to be k-cycle resonant were also given. In this paper, we improve the proof of the necessary and sufficient conditions for a graph to be k-cycle resonant, and further investigate planar k-cycle resonant graphs with k=1,2. Some new necessary and sufficient conditions for a planar graph to be 1-cycle resonant and 2-cycle resonant are established

K-CYCLE RESONANT GRAPHS

A connected graph G is said to be k-cycle resonant if, for 1 less than or equal to t less than or equal to 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