On the distance spectra of m-generation n-prism graph

On the distance spectra of m-generation n-prism graph

AbstractThe distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism graph or (m, n)-prism graph can be defined in an i...

Full description

Bibliographic Details
Main Authors: Fouzul Atik, Priti Prasanna Mondal, Firdoshi Parveen
Format: Article
Language:English
Published: Taylor & Francis Group 2022-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Distance matrix
distance eigenvalues
path
cycle
prism graph
05C50
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2022.2137443

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2022.2137443

Similar Items