On the Maximum ABC Spectral Radius of Connected Graphs and Trees

Abstract: Let

G = (V, E)

be a connected graph, where

V = v_{1}, v_{2}, c d o t s, v_{n}

and

m = | E |

.

d_{i}

will denote the degree of vertex

v_{i}

of

G

, and

D e l t a = m a x_{1 l e q i l e q n} d_{i}

. The ABC matrix of

G

is defined as

M (G) = (m_{i j})_{n i m e s n}

, where

m_{i j} = s q r t (d_{i} + d_{j} - 2) / (d_{i} d_{j})

if

v_{i} v_{j} i n E

, and 0 otherwise. The largest eigenvalue of

M (G)

is called the ABC spectral radius of

G

, denoted by

h o_{A B C} (G)

. Recently, this graph invariant has attracted some attentions. We prove that

h o_{A B C} (G) l e q s q r t D e l t a + (2 m - n + 1) / D e l t a - 2

. As an application, the unique tree with

n g e q 4

vertices having second largest ABC spectral radius is determined.

This page was built for publication: On the Maximum ABC Spectral Radius of Connected Graphs and Trees