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

Publication date 11 November 2022

Abstract: Let

W_{n}

denote the wheel graph having

n

-vertices. If

i

and

j

are any two vertices of

W_{n}

, define [d_{ij}:= �egin{cases} 0 & mbox{if}~i=j \ 1 & mbox{if}~i~ mbox{and} ~j~ mbox{are adjacent} \ 2 & mbox{else}. end{cases}] Let

D

be the

n i m e s n

matrix with

(i, j)^{m t h}

entry equal to

d_{i j}

. The matrix

D

is called the distance matrix of

W_{n}

. Suppose

n g e q 5

is an odd integer. In this paper, we deduce a formula to compute the Moore-Penrose inverse of

D

. More precisely, we obtain an

n i m e s n

matrix

w i d e t i l d e L

and a rank one matrix

w w^{'}

such that [D^dagger = -frac{1}{2} widetilde{L}+frac{4}{n-1}ww'.] Here,

w i d e t i l d e L

is positive semidefinite,

m r a n k (w i d e t i l d e L) = n - 2

and all row sums are equal to zero.

Recommendations

Cites work

Cited in

(9)

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