The first two maximum Sombor spectral radii of bicyclic graphs

The Sombor matrix S ( G ) of a graph G was introduced by Gutman in 2021, in which the ( i, j )-entry is equal to √(deg 2 ( u i ) + deg 2 ( u j )) if the vertices u i and u j are adjacent in G , and zero otherwise, where deg( u i ) denotes the degree of vertex u i in G . In this paper, we obtain the extremal graphs with the first two maximum Sombor spectral radii in bicyclic graphs.

Authors

Institutions

Publication Details

Journal
RAIRO. Operations research
Published
2025-06-11
DOI
https://doi.org/10.1051/ro/2025075
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

The first two maximum Sombor spectral radii of bicyclic graphs

Yanhui Zhang, Xiaoling Ma, Yangyang Wu
RAIRO. Operations research
Graph theory and applications
article

The first two maximum Sombor spectral radii of bicyclic graphs

Yanhui Zhang, Xiaoling Ma, Yangyang Wu
article en

Abstract

The Sombor matrix S ( G ) of a graph G was introduced by Gutman in 2021, in which the ( i, j )-entry is equal to √(deg 2 ( u i ) + deg 2 ( u j )) if the vertices u i and u j are adjacent in G , and zero otherwise, where deg( u i ) denotes the degree of vertex u i in G . In this paper, we obtain the extremal graphs with the first two maximum Sombor spectral radii in bicyclic graphs.

RAIRO. Operations researchVol. 59(6)
Xinjiang University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 81%
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.