On the Wiener (r,s)-complexity of fullerene graphs Full article
| Journal |
Fullerenes Nanotubes and Carbon Nanostructures
ISSN: 1536-383X , E-ISSN: 1536-4046 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2022, Volume: 30, Number: 5, Pages: 508-511 Pages count : 4 DOI: 10.1080/1536383X.2021.1960511 | ||||
| Tags | Fullerenes; transmission; Wiener complexity | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (3)
| 1 | Sobolev Institute of Mathematics | 0314-2019-0016 |
| 2 | Tomsk State University | 075-02-2021-1392 |
| 3 | Russian Foundation for Basic Research | 19-01-00682 |
Abstract:
Fullerene graphs are mathematical models of fullerene molecules. The Wiener (r,s)-complexity of a fullerene graph G with vertex set V(G) is the number of pairwise distinct values of (r,s)-transmission (Formula presented.) of its vertices v: (Formula presented.) for positive integer r and s. The Wiener (1,1)-complexity is known as the Wiener complexity of a graph. Irregular graphs have maximum complexity equal to the number of vertices. No irregular fullerene graphs are known for the Wiener complexity. Fullerene (IPR fullerene) graphs with n vertices having the maximal Wiener (r,s)-complexity are counted for all (Formula presented.) ((Formula presented.)) and small r and s. The irregular fullerene graphs are also presented.
Cite:
Dobrynin A.A.
, Vesnin A.Y.
On the Wiener (r,s)-complexity of fullerene graphs
Fullerenes Nanotubes and Carbon Nanostructures. 2022. V.30. N5. P.508-511. DOI: 10.1080/1536383X.2021.1960511 WOS Scopus РИНЦ OpenAlex
On the Wiener (r,s)-complexity of fullerene graphs
Fullerenes Nanotubes and Carbon Nanostructures. 2022. V.30. N5. P.508-511. DOI: 10.1080/1536383X.2021.1960511 WOS Scopus РИНЦ OpenAlex
Identifiers:
| Web of science: | WOS:000681192700001 |
| Scopus: | 2-s2.0-85111899456 |
| Elibrary: | 47007530 |
| OpenAlex: | W3188595544 |