On the distance spectrum of distance regular graphs
From MaRDI portal
Publication:2347478
DOI10.1016/j.laa.2015.04.002zbMath1312.05077MaRDI QIDQ2347478
Fouzul Atik, Pratima Panigrahi
Publication date: 27 May 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.04.002
Related Items
Unnamed Item, The generalized distance spectrum of a graph and applications, On equitable partition of matrices and its applications, Distance eigenvalues of B(n, k), Spectral theory of products of digraphs, The distance Laplacian and distance signless Laplacian spectrum of the subdivision-vertex join and subdivision-edge join of two regular graphs, On distance Laplacian spectrum (energy) of graphs, On the distance spectra ofm-generationn-prism graph, Distance-regular graphs with a few \(q\)-distance eigenvalues, On the distance spectra of graphs, Addressing graph products and distance-regular graphs, On the distance spectrum of minimal cages and associated distance biregular graphs, Distance-regular graphs with small number of distinct distance eigenvalues, Graphs that are cospectral for the distance Laplacian
Cites Work
- The distance spectrum and energy of the compositions of regular graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Distance spectra and distance energy of integral circulant graphs
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- The Gewirtz graph: An exercise in the theory of graph spectra
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- Complete multipartite graphs are determined by their distance spectra
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- On the distance spectrum of graphs
- Distance spectrum of graph compositions
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- On the Addressing Problem for Loop Switching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item