Get all the updates for this publication

Journal

On distance matrices of wheel graphs with an odd number of verticesPublished in Taylor and Francis Ltd.

2020

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.

Topics: Wheel graph (64)%64% related to the paper, Matrix (mathematics) (62)%62% related to the paper, Circulant matrix (56)%56% related to the paper and Moore–Penrose pseudoinverse (55)%55% related to the paper

View more info for "On distance matrices of wheel graphs with an odd number of vertices"

Postprint Version

Content may be subject to copyright.This is an Accepted Manuscript of an article published by Taylor & Francis in Linear and Multilinear Algebra on 2020-10-... ...This is an Accepted Manuscript of an article published by Taylor & Francis in Linear and Multilinear Algebra on 2020-10-29, available online: https://www.tandfonline.com/10.1080/03081087.2020.1840499.

About the journal

Journal | Data powered by TypesetLinear and Multilinear Algebra |
---|---|

Publisher | Data powered by TypesetTaylor and Francis Ltd. |

ISSN | 03081087 |

Open Access | False |