Abstract
Let denote the wheel graph having n-vertices. If i and j are any two vertices of , define Let D be the matrix with entry equal to . The matrix D 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 D. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
