✦ LIBER ✦

On k -Resonant Fullerene Graphs

✍ Scribed by Ye, Dong; Qi, Zhongbin; Zhang, Heping

Book ID: 118197716
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 447 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/080712763

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-Cycle resonant graphs

✍ Xiaofeng Guo; Fuji Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

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

ChemInform Abstract: k-Resonant Benzenoi

ChemInform Abstract: k-Resonant Benzenoid Systems and k-Cycle Resonant Graphs.

✍ Xiaofeng Guo; Fuji Zhang 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 24 KB

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

Cyclical Edge-Connectivity of Fullerene

Cyclical Edge-Connectivity of Fullerene Graphs and (k, 6)-Cages

✍ Tomislav Došlić 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 154 KB

On Some Structural Properties of Fullere

On Some Structural Properties of Fullerene Graphs

✍ Tomislav Došlić 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 95 KB

On k-ordered graphs

✍ Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda L 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views