The Second Zagreb Spectral Radius of Tricyclic Graphs: Eventual Global Extremality

For every connected simple tricyclic graph G of order n ≥ 1040, we prove that the second Zagrebspectral radius of G is at most that of the balanced three-page book Hn,3, with equality only forG ∼= Hn,3. This establishes the eventual-extremality assertion in Wang and Wang’s conjecture forcyclomatic number three. The proof applies to all connected tricyclic graphs, without assuming aprescribed core or a dominating edge. A sharp weighted-adjacency inequality forces any spectralcompetitor to concentrate excess degree at two adjacent vertices. A two-hub Schur-complement boundthen excludes every remaining edge outside the hub pair; strict leaf balancing finishes the comparison.The explicit threshold is sufficient but not sharp, and no assertion is made for smaller orders or highercyclomatic numbers.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24326204
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Second Zagreb Spectral Radius of Tricyclic Graphs: Eventual Global Extremality

Tony Newton
1 links
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

The Second Zagreb Spectral Radius of Tricyclic Graphs: Eventual Global Extremality

Tony Newton
preprint en

Abstract

For every connected simple tricyclic graph G of order n ≥ 1040, we prove that the second Zagrebspectral radius of G is at most that of the balanced three-page book Hn,3, with equality only forG ∼= Hn,3. This establishes the eventual-extremality assertion in Wang and Wang’s conjecture forcyclomatic number three. The proof applies to all connected tricyclic graphs, without assuming aprescribed core or a dominating edge. A sharp weighted-adjacency inequality forces any spectralcompetitor to concentrate excess degree at two adjacent vertices. A two-hub Schur-complement boundthen excludes every remaining edge outside the hub pair; strict leaf balancing finishes the comparison.The explicit threshold is sufficient but not sharp, and no assertion is made for smaller orders or highercyclomatic numbers.

Zenodo (CERN European Organization for Nuclear Research)
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.

Laika access coming soon