Advertisement

Cyclic 7-edge-cuts in fullerene graphs

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

A fullerene graph is a planar cubic graph whose all faces are pentagonal and hexagonal. The structure of cyclic edge-cuts of fullerene graphs of sizes at most 6 is known. In the paper we study cyclic 7-edge connectivity of fullerene graphs, distinguishing between degenerate and non-degenerate cyclic edge-cuts, regarding the arrangement of the 12 pentagons. We prove that if there exists a non-degenerate cyclic 7-edge-cut in a fullerene graph, then the graph is a nanotube unless it is one of the two exceptions presented. We determined that there are 57 configurations of degenerate cyclic 7-edge-cuts, and we listed all of them.

This is a preview of subscription content, log in to check access.

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 199

This is the net price. Taxes to be calculated in checkout.

References

  1. 1

    Došlić T.: On lower bounds of number of perfect matchings in fullerene graphs. J. Math. Chem. 24, 359 (1998)

  2. 2

    Došlić T.: On some structural properties of fullerene graphs. J. Math. Chem. 31, 187 (2002)

  3. 3

    Došlić T.: Cyclical edge-connectivity of fullerene graphs and (k, 6)-cages. J. Math. Chem. 33, 103 (2003)

  4. 4

    Kardoš F., Škrekovski R.: Cyclic edge-cuts in fullerene graphs. J. Math. Chem. 22, 121 (2008)

  5. 5

    Klein D.J., Liu X.: Theorems for carbon cages. J. Math. Chem. 33, 199 (1992)

  6. 6

    Kutnar K., Marušič D.: On cyclic edge-connectivity of fullerenes. Discrete Appl. Math. 156(10), 1661 (2008)

  7. 7

    Qi Z., Zhang H.: A note on the cyclical edge-connectivity of fullerene graphs. J. Math. Chem. 43, 134 (2008)

  8. 8

    Qian J., Zhang F.: On the number of Kekulé structures in capped zigzag nanotubes. J. Math. Chem. 38, 233 (2005)

  9. 9

    Zhang F., Wang L.: k-resonance of open-ended carbon nanotubes. J. Math. Chem. 35, 87 (2004)

Download references

Author information

Correspondence to Borut Lužar.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kardoš, F., Krnc, M., Lužar, B. et al. Cyclic 7-edge-cuts in fullerene graphs. J Math Chem 47, 771–789 (2010) doi:10.1007/s10910-009-9599-0

Download citation

Keywords

  • Fullerene
  • Fullerene graph
  • Cyclic edge-connectivity
  • Cyclic edge-cuts