On the distance matrix of an infinite class of fullerene graphs

Document Type : Original Article


Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785 -163, I. R. Iran


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


[1] P.W. Fowler, D. E. Manolopoulos, An Atlas of Fullerenes, Oxford Univ. Press, Oxford, 1995.
[2] M. Ghorbani, T. Ghorbani, Computing the Wiener index of an infinite class of fullerenes, Studia
Ubb Chemia. 58 (2013) 43–50.
[3] M. Ghorbani, Computing Wiener index of C24n fullerenes, J. Comput. Theor. Nanosci. 12 (2015)
[4] M. Ghorbani, M. Songhori, Computing Wiener index of C12n fullerenes, Ars Combin. 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.
Volume 7, Issue 4
December 2022
Pages 179-190
  • Receive Date: 25 October 2022
  • Revise Date: 04 November 2022
  • Accept Date: 16 November 2022
  • Publish Date: 01 December 2022