On trees attaining the five largest ABS spectral radii

The atom-bond sum-connectivity (ABS) matrix of a graph G of order n is the square matrix of order n, whose (i, j)-entry is equal to (di + dj -2)/(di + dj) if the i-th vertex and the j-th vertex of G are adjacent, and 0 otherwise, where di is the degree of the i-th vertex of G.The ABS spectral radius of G is the largest eigenvalue of the ABS matrix of G.In this paper, the trees of order n with the first five largest ABS spectral radii are characterized.

Authors

Institutions

Publication Details

Journal
Electronic Journal of Mathematics
Published
2025-09-19
DOI
https://doi.org/10.47443/ejm.2025.047
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On trees attaining the five largest ABS spectral radii

Zhen Lin, Yingke Liu
Electronic Journal of Mathematics
Matrix Theory and Algorithms
article

On trees attaining the five largest ABS spectral radii

Zhen Lin, Yingke Liu
article en

Abstract

The atom-bond sum-connectivity (ABS) matrix of a graph G of order n is the square matrix of order n, whose (i, j)-entry is equal to (di + dj -2)/(di + dj) if the i-th vertex and the j-th vertex of G are adjacent, and 0 otherwise, where di is the degree of the i-th vertex of G.The ABS spectral radius of G is the largest eigenvalue of the ABS matrix of G.In this paper, the trees of order n with the first five largest ABS spectral radii are characterized.

Electronic Journal of MathematicsVol. 10
Qinghai Normal University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 73%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.