X
On distance matrices of wheel graphs with an odd number of vertices
R.B. Bapat, S. Goel
Published in Taylor and Francis Ltd.
2020
Abstract
Let (Formula presented.) denote the wheel graph having n-vertices. If i and j are any two vertices of (Formula presented.), define (Formula presented.) Let D be the (Formula presented.) matrix with (Formula presented.) entry equal to (Formula presented.). The matrix D is called the distance matrix of (Formula presented.). Suppose (Formula presented.) is an odd integer. In this paper, we deduce a formula to compute the Moore-Penrose inverse of D. More precisely, we obtain an (Formula presented.) matrix (Formula presented.) and a rank one matrix (Formula presented.) such that (Formula presented.) Here, (Formula presented.) is positive semidefinite, (Formula presented.) and all row sums are equal to zero. © 2020 Informa UK Limited, trading as Taylor & Francis Group.