Arithmetic-Geometric Spectral Radius of Trees and Unicyclic Graphs

Abstract: The arithmetic-geometric matrix

A_{a g} (G)

of a graph

G

is a square matrix, where the

(i, j)

-entry is equal to

d i s p l a y s t y l e f r a c d_{i} + d_{j} 2 s q r t d_{i} d_{j}

if the vertices

v_{i}

and

v_{j}

are adjacent, and 0 otherwise. The arithmetic-geometric spectral radius of

G

, denoted by

h o_{a g} (G)

, is the largest eigenvalue of the arithmetic-geometric matrix

A_{a g} (G)

. Let

S_{n}

be the star of order

n g e q 3

and

S_{n} + e

be the unicyclic graph obtained from

S_{n}

by adding an edge. In this paper, we prove that for any tree

T

of order

n g e q 2

,

d i s p l a y s t y l e 2 c o s f r a c p i n + 1 l e q h o_{a g} (P_{n}) l e q h o_{a g} (T) l e q h o_{a g} (S_{n}) = f r a c n 2,

with equality if and only if

T c o n g P_{n}

for the lower bound, and if and only if

T c o n g S_{n}

for the upper bound. We also prove that for any unicyclic graph

G

of order

n g e q 3

,

d i s p l a y s t y l e 2 = h o_{a g} (C_{n}) l e q h o_{a g} (G) l e q h o_{a g} (S_{n} + e),

the lower (upper, respectively) bound is attained if and only if

T c o n g C_{n}

(

T c o n g S_{n} + e

, respectively) and

d i s p l a y s t y l e h o_{a g} (S_{n} + e) < f r a c n 2

for

n g e q 7

.

This page was built for publication: Arithmetic-Geometric Spectral Radius of Trees and Unicyclic Graphs