100
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

The Cyclic Edge Connectivity and Anti-Kekulé Number of the (5,6,7)-Fullerene

, & ORCID Icon
Pages 144-149 | Received 07 Dec 2016, Accepted 06 Sep 2017, Published online: 14 Nov 2017
 

ABSTRACT

A plane cubic graph is called a (5,6,7)-fullerene if its faces are only composed of pentagons, hexagons and heptagons. In this paper, we completely characterize the cyclic edge-connectivity of the (5,6,7)-fullerene. Furthermore, we obtain that the anti-Kekulé number of the (5,6,7)-fullerene is 4 when the cyclic edge-connectivity is larger then three. In particular, we obtain some properties with respect to the anti-Kekulé number of the (5,6,7)-fullerene with cyclic 3 edge-connectivity if it is 2-extendable.

Acknowledgments

The authors are very grateful to the referees for the constructive suggestions and comments.

Funding

This work is supported by NSFC (11761056), by the NSF of Qinghai (2016-ZJ-947Q), by the Education Department of Shaanxi Province (15JK1135) and Human Society Department of Gansu Province, and by Shaanxi University of Technology (SLGQD14-14).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,492.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.