On distance matrices of wheel graphs with an odd number of vertices

DOI10.1080/03081087.2020.1840499zbMath1506.05116arXiv2006.03289OpenAlexW3097141987WikidataQ114100584 ScholiaQ114100584MaRDI QIDQ5049199

Shivani Goel, Ravindra B. Bapat, Ramamurthy Balaji

Publication date: 11 November 2022

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.03289

zbMATH Keywords

Moore-Penrose inversecirculant matricesLaplacian matricesdistance matriceswheel graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (3)

Steiner distance matrix of caterpillar graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• On Euclidean distance matrices
• Distance matrix polynomials of trees
• Euclidean graph distance matrices of generalizations of the star graph
• On distance matrices and Laplacians
• An inverse formula for the distance matrix of a wheel graph with an even number of vertices
• Distance spectra of graphs: a survey
• Inverse of the distance matrix of a block graph
• Unnamed Item

This page was built for publication: On distance matrices of wheel graphs with an odd number of vertices