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

References

  • G. Hopkins and W. Staton, “Extremal Bipartite Subgraphs of Cubic Triange-Free Cubic Graphs,” Journal of Graph Theory 6 (1982): 115–21.
  • C. Thomassen, “On the Max-Cut Problem for a Planar, Cubic, Triangle-Free Graph, and the Chinese Postman Problem for a Planar Triangulation,” Journal of Graph Theory 53 (2006): 261–9.
  • D. Ye, “On the Anti-Kekulé Number and Odd Cycle Transversal of Regular Graphs,” Discrete Applied Mathematics 161 (2013): 2196–9.
  • S. Lijima, T. Ichihashi, and Y. Ando, “Heptagons and Negative Curvature in Graphite Nicrotubule Growth,” Nature 356 (1992): 776–8.
  • T. Dos̆lić, “On Some Structural Properties of Fullerene Graphs,” Journal of Mathematical Chemistry 31 (2002): 187–95.
  • X. Gao, W. Liu, and Y. Luo, “On the Extendability of Certain Semi-Cayley Graphs of Finite Abelian Groups,” Discrete Mathematics 311 (2011): 1978–87.
  • F. Kardos̆, M. Krnc, B. Luz̆ar, and R. s̆krekovski, “Cyclic 7-Edge-Cuts in Fullerene Graphs,” Journal of Mathematical Chemistry 47 (2010): 771–89.
  • Q. Li, S. Liu, and H. Zhang, “2-Extendability and k-Resonance of Non-Bipartite Klein-Bottle Polyhexes,” Discrete Applied Mathematics 159 (2011): 800–11.
  • S. Negami and Y. Suzuki, “The 2-Extendability of 5-Connected Graphs on the Klein Bottle,” Discrete Mathematics 310 (2010): 2510–8.
  • S. Ren, “On Some Structural Properties of Generalized Fullerene Graphs With 13 Pentagonal Faces,” Discrete Mathematics 311 (2011): 1666–9.
  • D. Ye and H. Zhang, “2-Extendability of Toroidal Polyhexes and Klein-Bottle Polyhexes,” Discrete Applied Mathematics 157 (2009): 292–9.
  • D. Vukičević and N. Trinajstić, “On the Anti-Kekulé Number and Anti-Forcing Number of Cata-Condensed Benzenoids,” Journal of Mathematical Chemistry 43 (2007): 575–83.
  • D. Vukičević and N. Trinajstić, “On the Anti-Kekulé Number and Anti-Forcing Number of Cata-Condensed Benzenoids,” Journal of Mathematical Chemistry 43 (2008): 719–26.
  • F. Kardos̆, D. Kraál, J. Mis̆kuf, and J. Sereni, “Fullerene Graphs have Exponentially Many Perfect Matchings,” Journal of Mathematical Chemistry 46 (2009): 443–7.
  • D. Veljan and D. Vukičević, “The Anti-Kekulé Number of the Infinte Triangular, Rectangular and Hexagonal Grids,” Glasnik Matematicki 43 (2008): 243–52.
  • Q. Yang, D. Ye, H. Zhang, and Y. Lin, “On the Anti-Kekulé Number of Fullerenes,” MATCH Communications in Mathematical and in Computer Chemistry 67 (2012): 281–8.
  • M. Plummer, “Extending Matchings in Graphs: A Survey,” Discrete Applied Mathematics 127 (1994): 277–92.
  • L. Lovász and M. Plummer, Matching Theory (American Mathematical Society, North-Holland, Amsterdam, 2009).
  • W. Tutte, “The Factorization of Linear Graphs,” Journal of the London Mathematical Society 22 (1947): 107–11.
  • I. Gutman and O. E. Polansky, Mathematical Concepts in Organic Chemistry (Berlin: Springer, 1986).
  • D. Ye, Z. Qi, and H. Zhang, “On k-Resonant Fullerene Graphs,” SIAM Journal on Discrete Mathematics 23 (2009): 1023–44.
  • H. Zhang, D. Ye, and W.C. Shiu, “Forcing Matching Numbers of Fullerene Graphs,” Discrete Applied Mathematics 158 (2010): 573–82.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.