Advanced search
1 file | 362.00 KB Add to list

Fullerenes with distant pentagons

Author
Organization
Project
HPC-UGent: the central High Performance Computing infrastructure of Ghent University
Abstract
For each d > 0, we find all the smallest fullerenes for which the least distance between two pentagons is d. We also show that for each d there is an h(d) such that fullerenes with pentagons at least distance d apart and any number of hexagons greater than or equal to h(d) exist. We also determine the number of fullerenes where the minimum distance between any two pentagons is at least d, for 1 <= d <= 5, up to 400 vertices.
Keywords
GRAPHS, CARBON CAGES

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 362.00 KB

Citation

Please use this url to cite or link to this publication:

MLA
Goedgebeur, Jan, and Brendan D McKay. “Fullerenes with Distant Pentagons.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 74.3 (2015): 659–672. Print.
APA
Goedgebeur, J., & McKay, B. D. (2015). Fullerenes with distant pentagons. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 74(3), 659–672.
Chicago author-date
Goedgebeur, Jan, and Brendan D McKay. 2015. “Fullerenes with Distant Pentagons.” Match-communications in Mathematical and in Computer Chemistry 74 (3): 659–672.
Chicago author-date (all authors)
Goedgebeur, Jan, and Brendan D McKay. 2015. “Fullerenes with Distant Pentagons.” Match-communications in Mathematical and in Computer Chemistry 74 (3): 659–672.
Vancouver
1.
Goedgebeur J, McKay BD. Fullerenes with distant pentagons. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY. 2015;74(3):659–72.
IEEE
[1]
J. Goedgebeur and B. D. McKay, “Fullerenes with distant pentagons,” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 74, no. 3, pp. 659–672, 2015.
@article{7019074,
  abstract     = {For each d > 0, we find all the smallest fullerenes for which the least distance between two pentagons is d. We also show that for each d there is an h(d) such that fullerenes with pentagons at least distance d apart and any number of hexagons greater than or equal to h(d) exist. 
We also determine the number of fullerenes where the minimum distance between any two pentagons is at least d, for 1 <= d <= 5, up to 400 vertices.},
  author       = {Goedgebeur, Jan and McKay, Brendan D},
  issn         = {0340-6253},
  journal      = {MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY},
  keywords     = {GRAPHS,CARBON CAGES},
  language     = {eng},
  number       = {3},
  pages        = {659--672},
  title        = {Fullerenes with distant pentagons},
  volume       = {74},
  year         = {2015},
}

Web of Science
Times cited: