Ordering Trees by Their ABC Spectral Radii

Authors Wenshui Lin, Zhangyong Yan, Peifang Fu, Jiabao Liu

Publication date 3 August 2020

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Let

G = (V, E)

be a connected graph, where

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

. Let

d_{i}

denote the degree of vertex

v_{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 ABC spectral radius of

G

is the largest eigenvalue of

M (G)

. In the present paper, we establish two graph perturbations with respect to ABC spectral radius. By applying these perturbations, the trees with the third, fourth, and fifth largest ABC spectral radii are determined.

This page was built for publication: Ordering Trees by Their ABC Spectral Radii

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