Cyclical edge-connectivity of fullerene graphs and (k, 6)-cages

Journal of Mathematical Chemistry

Volumn 33, Issue 2, 2003, Pages 103-112

  Došlić, Tomislav ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

(k, 6) cages; Cyclical edge connectivity; Fullerene graphs; Fullerenes; Perfect matching

Indexed keywords

FULLERENE;

ARTICLE; GEOMETRY; MATHEMATICAL COMPUTING;

EID: 0347132502     PISSN: 02599791     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023299815308     Document Type: Article

References (6)

1. T. Došlić, On lower bounds of number of perfect matchings in fullerene graphs, J. Math. Chem. 24 (1998) 359-364.
2. T. Došlić, On some structural properties of fullerene graphs, J. Math. Chem. 31 (2002) 187-195.
3. H. Zhang and F. Zhang, New lower bound on the number of perfect matchings in fullerene graphs, J. Math. Chem. 30 (2001) 343-347.
4. D.B. West, Introduction to Graph Theory (Prentice Hall, Upper Saddle River, NJ, 1996).
5. L. Lovász and M.D. Plummer, Matching Theory, Ann. Discr. Math., Vol. 29 (North-Holland, Amsterdam, The Netherlands, 1986).
6. D.J. Klein and X. Liu, Theorems for carbon cages, J. Math. Chem. 11 (1992) 199-205. 112