The minimum spectral radius of tP4-saturated graphs
Discrete Mathematics · 2027-02 · 350 (2) · 115500
DOI: 10.1016/j.disc.2026.115500 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2027-02. Verfasst von Junxue Zhang und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
A graph $G$ is called {\em$F$-saturated} if $G$ does not contain $F$ as a subgraph but adding any missing edge to $G$ creates a copy of $F$. In this paper, we consider the spectral saturation problem for the linear forest $tP_4$, proving that every $n$-vertex $tP_4$-saturated graph $G$ with $t\geq 2$ and $n\ge 4t$ satisfies $\rho(G)\ge \frac{1+\sqrt{17}}{2}$, and characterizing all $tP_4$-saturated graphs for which equality holds. Moreover, we obtain that, for $t=2$ with odd $n\ge 13 $, and for $t\ge 3$ with $n\ge 6t+4$, the set of $n$-vertex $tP_4$-saturated graphs minimizing the spectral radius is disjoint from that minimizing the number of edges.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhang, J., & Zhang, L. (2027). The minimum spectral radius of tP4-saturated graphs. Discrete Mathematics, 350(2), 115500. https://doi.org/10.1016/j.disc.2026.115500
Vancouver
Zhang J, Zhang L. The minimum spectral radius of tP4-saturated graphs. Discrete Mathematics. 2027;350(2):115500. doi:10.1016/j.disc.2026.115500
BibTeX
@article{Zhang2027,
author = {Zhang, Junxue and Zhang, Liwen},
title = {The minimum spectral radius of tP4-saturated graphs},
journal = {Discrete Mathematics},
year = {2027},
volume = {350},
number = {2},
pages = {115500},
doi = {10.1016/j.disc.2026.115500}
}
EUVIMED