Abstract
Let denote the wheel graph having -vertices. If and are any two vertices of , 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 be the matrix with entry equal to . The matrix is called the distance matrix of . Suppose is an odd integer. In this paper, we deduce a formula to compute the Moore-Penrose inverse of . More precisely, we obtain an matrix and a rank one matrix such that Here, is positive semidefinite, and all row sums are equal to zero.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.