On Squared Distance Matrix of Complete Multipartite Graphs

Abstract: Let

G = K_{n_{1}, n_{2}, c d o t s, n_{t}}

be a complete

t

-partite graph on

n = s u m_{i = 1}^{t} n_{i}

vertices. The distance between vertices

i

and

j

in

G

, denoted by

d_{i j}

is defined to be the length of the shortest path between

i

and

j

. The squared distance matrix

D e l t a (G)

of

G

is the

n i m e s n

matrix with

(i, j)^{t h}

entry equal to

0

if

i = j

and equal to

d_{i j}^{2}

if

i e q j

. We define the squared distance energy

E_{D e l t a} (G)

of

G

to be the sum of the absolute values of its eigenvalues. We determine the inertia of

D e l t a (G)

and compute the squared distance energy

E_{D e l t a} (G)

. More precisely, we prove that if

n_{i} g e q 2

for

1 l e q i l e q t

, then

E_{D e l t a} (G) = 8 (n - t)

and if

h = | i : n_{i} = 1 | g e q 1

, then

8(n-t)+2(h-1) leq E_{Delta}(G) < 8(n-t)+2h.

Furthermore, we show that for a fixed value of

n

and

t

, both the spectral radius of the squared distance matrix and the squared distance energy of complete

t

-partite graphs on

n

vertices are maximal for complete split graph

S_{n, t}

and minimal for Tur{'a}n graph

T_{n, t}

.

This page was built for publication: On Squared Distance Matrix of Complete Multipartite Graphs