The saturation number is at most the harmonic index in subquartic graphs

We prove that the saturation number μ∗(G) is at most the harmonic index H(G) for every finite simple graph G with maximum degree at most 4. This resolves a conjecture of Gupta.

Authors

Publication Details

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

The saturation number is at most the harmonic index in subquartic graphs

Jakub Zabrzeski
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

The saturation number is at most the harmonic index in subquartic graphs

Jakub Zabrzeski
preprint en

Abstract

We prove that the saturation number μ∗(G) is at most the harmonic index H(G) for every finite simple graph G with maximum degree at most 4. This resolves a conjecture of Gupta.

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