Author:
Dobrynin Andrey A.,Vesnin Andrei Yu
Abstract
Fullerenes are molecules that can be presented in the form of cage-like polyhedra, consisting only of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex v of a graph is a local graph invariant defined as the sum of distances from v to all the other vertices. The number of different vertex transmissions is called the Wiener complexity of a graph. Some calculation results on the Wiener complexity and the Wiener index of fullerene graphs of order n ≤ 232 and IPR fullerene graphs of order n ≤ 270 are presented. The structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed, and formulas for the Wiener index of several families of graphs are obtained.
Funder
Ministry of Education and Science of the Russian Federation
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference49 articles.
1. Distance, Symmetry, and Topology in Carbon Nanomaterials;Ashrafi,2016
2. The Mathematics and Topology of Fullerenes;Cataldo,2011
3. A Constructive Enumeration of Fullerenes
4. An Atlas of Fullerenes;Fowler,1995
5. Recursive generation of IPR fullerenes
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献