On distance matrices of wheel graphs with odd number of vertices

preprint2020arXivOpen access

Abstract

Let WnW_n denote the wheel graph having nn-vertices. If ii and jj are any two vertices of WnW_n, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\] Let DD be the n×nn \times n matrix with (i,j)th(i,j)^{\rm th} entry equal to dijd_{ij}. The matrix DD is called the distance matrix of WnW_n. Suppose n≥5n \geq 5 is an odd integer. In this paper, we deduce a formula to compute the Moore-Penrose inverse of DD. More precisely, we obtain an n×nn\times n matrix L~\widetilde{L} and a rank one matrix ww′ww' such that D†=−12L~+4n−1ww′.D^\dagger = -\frac{1}{2} \widetilde{L}+\frac{4}{n-1}ww'. Here, L~\widetilde{L} is positive semidefinite, rank(L~)=n−2{\rm rank}(\widetilde{L})=n-2 and all row sums are equal to zero.

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.