On the atom-bond sum-connectivity spectral radius of unicyclic graphs

Let G be a graph with n vertices.For i = 1, 2, . . ., n, let di be the degree of vertex vi in G.The atom-bond sum-connectivity (ABS) matrix of G is an n n matrix whose (i, j)-entry is equal to (di + dj -2)/(di + dj) if the vertices vi and vj are adjacent, and 0 otherwise.The ABS spectral radius of G, denoted by 1(G), is the largest eigenvalue of the ABS matrix of G. Let Cn be the cycle graph with n vertices.Let U 1 n be the unicyclic graph with n vertices and maximum degree n -1.For a unicyclic graph G with n 17 vertices, we prove that 1(Cn) 1(G) 1(U 1 n ), where the left equality holds if and only if G = Cn and the right equality holds if and only if G = U 1 n .

Publication Details

Journal
Discrete Mathematics Letters
Published
2025-05-06
DOI
https://doi.org/10.47443/dml.2025.015
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

On the atom-bond sum-connectivity spectral radius of unicyclic graphs

Discrete Mathematics Letters
Graph theory and applications
article

On the atom-bond sum-connectivity spectral radius of unicyclic graphs

article en

Abstract

Let G be a graph with n vertices.For i = 1, 2, . . ., n, let di be the degree of vertex vi in G.The atom-bond sum-connectivity (ABS) matrix of G is an n n matrix whose (i, j)-entry is equal to (di + dj -2)/(di + dj) if the vertices vi and vj are adjacent, and 0 otherwise.The ABS spectral radius of G, denoted by 1(G), is the largest eigenvalue of the ABS matrix of G. Let Cn be the cycle graph with n vertices.Let U 1 n be the unicyclic graph with n vertices and maximum degree n -1.For a unicyclic graph G with n 17 vertices, we prove that 1(Cn) 1(G) 1(U 1 n ), where the left equality holds if and only if G = Cn and the right equality holds if and only if G = U 1 n .

Discrete Mathematics LettersVol. 15
Qinghai Normal University
Openalex Percentile: Top 85%
Graph theory and applications
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.