On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices

Abstract: Let

n g e q 4

. The helm graph

H_{n}

on

2 n - 1

vertices is obtained from the wheel graph

W_{n}

by adjoining a pendant edge to each vertex of the outer cycle of

W_{n}

. Suppose

n

is even. Let

D := [d_{i j}]

be the distance matrix of

H_{n}

. In this paper, we first show that

d e t (D) = 3 (n - 1) 2^{n - 1} .

Next, we find a matrix

L

and a vector

u

such that [D^{-1} = -frac{1}{2}L+frac{4}{3(n-1)}uu'.] We also prove an interlacing property between the eigenvalues of

L

and

D

.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices