On the distance matrix of an infinite class of fullerene graphs
نویسندگان
1 دانشگاه شهید بهشتی
2 دانشگاه آزاد اسلامی واحد علوم و تحقیقات
doi
10.22061/jdma.2022.1940چکیده
Let G be a graph, the distance d(u,v) between two vertices u and v of G is the minimumlength of the paths connecting them. The aim of this paper is computing the distance matrix of infinite familiy of fullerene graph A10n.
