On Eccentricity Matrices of Wheel Graphs

Publication date 21 June 2022

Abstract: The eccentricity matrix

E (G)

of a simple connected graph

G

is obtained from the distance matrix

D (G)

of

G

by retaining the largest distance in each row and column, and by defining the remaining entries to be zero. This paper focuses on the eccentricity matrix

E (W_{n})

of the wheel graph

W_{n}

with

n

vertices. By establishing a formula for the determinant of

E (W_{n})

, we show that

E (W_{n})

is invertible if and only if

n o t e q u i v 1 M o d 3

. We derive a formula for the inverse of

E (W_{n})

by finding a vector

m a t h b f w i n m a t h b b R^{n}

and an

n i m e s n

symmetric Laplacian-like matrix

w i d e t i l d e L

of rank

n - 1

such that �egin{eqnarray*} E(W_n)^{-1} = -frac{1}{2}widetilde{L} + frac{6}{n-1}mathbf{w}mathbf{w^{prime}}. end{eqnarray*} Further, we prove an analogous result for the Moore-Penrose inverse of

E (W_{n})

for the singular case. We also determine the inertia of

E (W_{n})

.

This page was built for publication: On Eccentricity Matrices of Wheel Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402702)