An inverse formula for the distance matrix of a wheel graph with even number of vertices

preprint2020arXivOpen access

Abstract

Let n≥4n \geq 4 be an even integer and WnW_n be the wheel graph with nn vertices. The distance dijd_{ij} between any two distinct vertices ii and jj of WnW_n is the length of the shortest path connecting ii and jj. Let DD be the n×nn \times n symmetric matrix with diagonal entries equal to zero and off-diagonal entries equal to dijd_{ij}. In this paper, we find a positive semidefinite matrix L~\widetilde{L} such that rank(L~)=n−1{\rm rank}(\widetilde{L})=n-1, all row sums of L~\widetilde{L} equal to zero and a rank one matrix wwTww^T such that D−1=−12L~+4n−1wwT.D^{-1}=-\frac{1}{2}\widetilde{L} + \frac{4}{n-1}ww^T. An interlacing property between the eigenvalues of DD and L~\widetilde{L} is also proved.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.