Extremal graphs minimizing the normalized Laplacian spectral radius
Utilitas Mathematica · 22.07.2026 · 128 · 141-183
DOI: 10.61091/um128-08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 22.07.2026. Verfasst von Siyu Ou und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Let \(G\) be a simple connected graph and \(A(G)\) and \(D(G)\) represent the adjacency matrix and the diagonal matrix of degrees of graph G, respectively. The normalized Laplacian of \(G\) is defined by \(\mathcal{L}(G)=I_n-D(G)^{-1/2}A(G)D(G)^{-1/2},\) where \(I_n\) is the identity matrix of order \(n\). The normalized Laplacian plays an important role in spectral graph theory. In this paper, we characterize the connected graphs that minimize the spectral radius of the normalized Laplacian in the class of graphs with exactly one vertex of degree greater than two and in the class of graphs with exactly two vertices of degree greater than two. In each class, we determine the extremal graphs and the exact minimum normalized Laplacian spectral radius.
Zitieren
APA
Ou, S., Qiu, Z., & Tang, Z. (2026). Extremal graphs minimizing the normalized Laplacian spectral radius. Utilitas Mathematica, 128, 141-183. https://doi.org/10.61091/um128-08
Vancouver
Ou S, Qiu Z, Tang Z. Extremal graphs minimizing the normalized Laplacian spectral radius. Utilitas Mathematica. 2026;128:141-183. doi:10.61091/um128-08
BibTeX
@article{Ou2026,
author = {Ou, Siyu and Qiu, Zhengping and Tang, Zikai},
title = {Extremal graphs minimizing the normalized Laplacian spectral radius},
journal = {Utilitas Mathematica},
year = {2026},
volume = {128},
pages = {141--183},
doi = {10.61091/um128-08}
}
EUVIMED