On the distance matrix of an infinite class of fullerene graphs

Document Type: Original Article

Author

Department of Mathematics‎, ‎Faculty of Science‎, ‎Shahid Rajaee Teacher Training University‎, ‎Tehran‎, ‎16785 – 136‎, ‎I‎. ‎R‎. ‎Iran

10.22061/jmns.2018.977

Abstract

Let G be a graph, the distance d(u,v) between two vertices u and v of G is the minimum
length of the paths connecting them. The aim of this paper is computing the distance matrix of infinite
familiy of fullerene graph
A10n.

Graphical Abstract

On the distance matrix of an infinite class of fullerene graphs

Keywords

Main Subjects


[1] P. W. Fowler, D. E. Manolopoulos, An Atlas of Fullerenes, Oxford Univ. Press, Oxford, 1995.
[2] M.GhorbaniandT.Ghorbani, ComputingtheWienerindexofaninfiniteclassoffullerenes, Studia
Ubb Chemia 58 (2013) 43–50.
[3] M. Ghorbani, Computing Wiener index of C24nfullerenes, J. Comput. Theor. Nanosci. 12 (2015)
1847–1851.
[4] M.GhorbaniandM.Songhori, ComputingWienerindexof C12nfullerenes, ArsCombin.130(2017)
175–180.
[5] H. W. Kroto, J. E. Fichier, D. E. Cox, ”The Fullerene”, Pergamon Press, Inc., New York, 1993.
[6] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc. 69 (1947) 17–20.