메뉴 건너뛰기




Volumn 156, Issue 10, 2008, Pages 1661-1669

On cyclic edge-connectivity of fullerenes

Author keywords

Cyclic edge connectivity; Fullerene graph; Graph; Hamilton cycle; Perfect matching

Indexed keywords

CARBON; FULLERENES; GRAPH THEORY; NANOSTRUCTURES;

EID: 45849126188     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.08.046     Document Type: Article
Times cited : (56)

References (33)
  • 2
    • 0345846514 scopus 로고
    • Uniform cyclic edge connectivity in cubic graphs
    • Aldred R.E.L., Holton D.A., and Jackson B. Uniform cyclic edge connectivity in cubic graphs. Combinatorics 11 (1991) 81-96
    • (1991) Combinatorics , vol.11 , pp. 81-96
    • Aldred, R.E.L.1    Holton, D.A.2    Jackson, B.3
  • 3
    • 0041546777 scopus 로고
    • Conjecture 5
    • Tutte W.T. (Ed), Academic Press, New York
    • Barnette D. Conjecture 5. In: Tutte W.T. (Ed). Recent Progress in Combinatorics (1969), Academic Press, New York
    • (1969) Recent Progress in Combinatorics
    • Barnette, D.1
  • 4
    • 26444591523 scopus 로고    scopus 로고
    • Construction of planar triangulations with minimum degree 5
    • Brinkmann G., and McKay B.D. Construction of planar triangulations with minimum degree 5. Discrete Math. 301 (2005) 147-163
    • (2005) Discrete Math. , vol.301 , pp. 147-163
    • Brinkmann, G.1    McKay, B.D.2
  • 7
    • 0042942285 scopus 로고    scopus 로고
    • Fullerenes and coordination polyhedra versus half-cube embeddings
    • Deza A., Deza M., and Grishukhin V. Fullerenes and coordination polyhedra versus half-cube embeddings. Discrete Math. 192 (1998) 41-80
    • (1998) Discrete Math. , vol.192 , pp. 41-80
    • Deza, A.1    Deza, M.2    Grishukhin, V.3
  • 9
    • 0040581129 scopus 로고    scopus 로고
    • On lower bounds of number of perfect matchings in fullerene graphs
    • Došlić T. On lower bounds of number of perfect matchings in fullerene graphs. J. Math. Chem. 24 (1998) 359-364
    • (1998) J. Math. Chem. , vol.24 , pp. 359-364
    • Došlić, T.1
  • 10
    • 0036486103 scopus 로고    scopus 로고
    • On some structural properties of fullerene graphs
    • Došlić T. On some structural properties of fullerene graphs. J. Math. Chem. 31 (2002) 187-195
    • (2002) J. Math. Chem. , vol.31 , pp. 187-195
    • Došlić, T.1
  • 11
    • 0347132502 scopus 로고    scopus 로고
    • Cyclical edge-connectivity of fullerene graphs and (k, 6)-cages
    • Došlić T. Cyclical edge-connectivity of fullerene graphs and (k, 6)-cages. J. Math. Chem. 33 (2003) 103-112
    • (2003) J. Math. Chem. , vol.33 , pp. 103-112
    • Došlić, T.1
  • 12
    • 33847639404 scopus 로고    scopus 로고
    • Fullerene graphs with exponentially many perfect matchings
    • Došlić T. Fullerene graphs with exponentially many perfect matchings. J. Math. Chem. 41 (2007) 183-192
    • (2007) J. Math. Chem. , vol.41 , pp. 183-192
    • Došlić, T.1
  • 13
    • 9744272429 scopus 로고    scopus 로고
    • Encoding fullerenes and geodesic domes
    • Graver J.E. Encoding fullerenes and geodesic domes. SIAM. J. Discrete Math. 17 (2004) 596-614
    • (2004) SIAM. J. Discrete Math. , vol.17 , pp. 596-614
    • Graver, J.E.1
  • 15
    • 33646086010 scopus 로고    scopus 로고
    • The independence numbers of fullerenes and benzenoids
    • Graver J.E. The independence numbers of fullerenes and benzenoids. European J. Combin. 27 (2006) 850-863
    • (2006) European J. Combin. , vol.27 , pp. 850-863
    • Graver, J.E.1
  • 16
    • 33847633100 scopus 로고    scopus 로고
    • Kekulé structures and the face independence number of a fullerene
    • Graver J.E. Kekulé structures and the face independence number of a fullerene. European J. Combin. 28 (2007) 1115-1130
    • (2007) European J. Combin. , vol.28 , pp. 1115-1130
    • Graver, J.E.1
  • 18
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • Harary F. Graph Theory (1969), Addison-Wesley, Reading, MA
    • (1969) Graph Theory
    • Harary, F.1
  • 20
    • 0040888383 scopus 로고    scopus 로고
    • A cyclically 6-edge-connected snark of order 118
    • Kochol M. A cyclically 6-edge-connected snark of order 118. Discrete Math. 161 (1996) 297-300
    • (1996) Discrete Math. , vol.161 , pp. 297-300
    • Kochol, M.1
  • 21
    • 0037904783 scopus 로고
    • Lower bound of cyclic edge connectivity for n-extendability of regular graphs
    • Lou D., and Holton D.A. Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discrete Math. 112 (1993) 139-150
    • (1993) Discrete Math. , vol.112 , pp. 139-150
    • Lou, D.1    Holton, D.A.2
  • 22
    • 33846650908 scopus 로고    scopus 로고
    • Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
    • Máčajová E., and Škoviera M. Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6. Electron. J. Combin. 14 (2007) #R18
    • (2007) Electron. J. Combin. , vol.14
    • Máčajová, E.1    Škoviera, M.2
  • 23
    • 34250832196 scopus 로고    scopus 로고
    • Hamilton cycles and paths in fullerenes
    • Marušič D. Hamilton cycles and paths in fullerenes. J. Chem. Inf. Model. 47 (2007) 732-736
    • (2007) J. Chem. Inf. Model. , vol.47 , pp. 732-736
    • Marušič, D.1
  • 24
    • 45849100076 scopus 로고    scopus 로고
    • W.J. Myrvold, Investigating conjectures about fullerenes, in: Applications of Graph Theory to Chemistry, Minisymposium, 2006 SIAM Discrete Mathematics, June 25-28, 2006, University of Victoria, Canada.
    • W.J. Myrvold, Investigating conjectures about fullerenes, in: Applications of Graph Theory to Chemistry, Minisymposium, 2006 SIAM Discrete Mathematics, June 25-28, 2006, University of Victoria, Canada.
  • 25
    • 33645855838 scopus 로고
    • Atoms of cyclic connectivity in cubic graphs
    • Nedela R., and Škoviera M. Atoms of cyclic connectivity in cubic graphs. Math. Slovaca 45 (1995) 481-499
    • (1995) Math. Slovaca , vol.45 , pp. 481-499
    • Nedela, R.1    Škoviera, M.2
  • 26
    • 0035964006 scopus 로고    scopus 로고
    • Four-dimensional football, fullerenes and diagram geometry
    • Pasini A. Four-dimensional football, fullerenes and diagram geometry. Discrete Math. 238 (2001) 115-130
    • (2001) Discrete Math. , vol.238 , pp. 115-130
    • Pasini, A.1
  • 28
    • 45849085315 scopus 로고    scopus 로고
    • Z. Qi, H. Zhang, A note on the cyclical edge-connectivity of fullerene graphs, J. Math. Chem., in press.
    • Z. Qi, H. Zhang, A note on the cyclical edge-connectivity of fullerene graphs, J. Math. Chem., in press.
  • 29
    • 0141789719 scopus 로고    scopus 로고
    • Aromaticity of polycyclic conjugated hydrocarbons
    • Randić M. Aromaticity of polycyclic conjugated hydrocarbons. Chem. Rev. 103 (2003) 3449-3606
    • (2003) Chem. Rev. , vol.103 , pp. 3449-3606
    • Randić, M.1
  • 30
    • 0033590932 scopus 로고    scopus 로고
    • Medicinal chemistry with fullerenes and fullerene derivatives
    • Da Ross T., and Prato M. Medicinal chemistry with fullerenes and fullerene derivatives. Chem. Commun. 8 (1999) 663-669
    • (1999) Chem. Commun. , vol.8 , pp. 663-669
    • Da Ross, T.1    Prato, M.2
  • 33
    • 0035471115 scopus 로고    scopus 로고
    • New lower bound on the number of perfect matchings in fullerene graphs
    • Zhang H., and Zhang F. New lower bound on the number of perfect matchings in fullerene graphs. J. Math. Chem. 30 (2001) 343-347
    • (2001) J. Math. Chem. , vol.30 , pp. 343-347
    • Zhang, H.1    Zhang, F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.