On the Wiener complexity and the Wiener Index of fullerene graphs

Standard

On the Wiener complexity and the Wiener Index of fullerene graphs. / Dobrynin, Andrey A.; Vesnin, Andrei Yu.

в: Mathematics, Том 7, № 11, 1071, 01.11.2019.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

BibTeX

@article{f4398efd7ab54068806c82e216200f3f,

title = "On the Wiener complexity and the Wiener Index of fullerene graphs",

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 theWiener complexity and theWiener 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.",

keywords = "Fullerene, Graph, Wiener complexity, Wiener index, MATHEMATICAL ASPECTS, TREES, INFINITE FAMILY, ISOMERS, CONSTRUCTIVE ENUMERATION, graph, fullerene",

author = "Dobrynin, {Andrey A.} and Vesnin, {Andrei Yu}",

year = "2019",

month = nov,

day = "1",

doi = "10.3390/math7111071",

language = "English",

volume = "7",

journal = "Mathematics",

issn = "2227-7390",

publisher = "MDPI AG",

number = "11",

}

RIS

TY - JOUR

T1 - On the Wiener complexity and the Wiener Index of fullerene graphs

AU - Dobrynin, Andrey A.

AU - Vesnin, Andrei Yu

PY - 2019/11/1

Y1 - 2019/11/1

N2 - 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 theWiener complexity and theWiener 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.

AB - 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 theWiener complexity and theWiener 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.

KW - Fullerene

KW - Graph

KW - Wiener complexity

KW - Wiener index

KW - MATHEMATICAL ASPECTS

KW - TREES

KW - INFINITE FAMILY

KW - ISOMERS

KW - CONSTRUCTIVE ENUMERATION

KW - graph

KW - fullerene

UR - http://www.scopus.com/inward/record.url?scp=85075333888&partnerID=8YFLogxK

U2 - 10.3390/math7111071

DO - 10.3390/math7111071

M3 - Article

AN - SCOPUS:85075333888

VL - 7

JO - Mathematics

JF - Mathematics

SN - 2227-7390

IS - 11

M1 - 1071

ER -

ID: 22405000