The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices
Mathematics · 29.07.2026 · 14 (15) · 2708
DOI: 10.3390/math14152708 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 29.07.2026. Verfasst von Jinfeng Zhang und 5 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Xinjiang Uygur Autonomous Region, Natural Science Foundation of Guangxi province, Science and Technology Project of Guangxi.
Abstract (Originalsprache)
Let G be a connected simple graph with the vertex set V(G)={v1,v2,…,vn}, where the distance dG(vi,vj) is the length of a shortest path between vi and vj, and the distance matrix D(G)=(dij)n×n is defined by dij=dG(vi,vj). Being real symmetric and non-negative, D(G) has real eigenvalues λ1(G)≥λ2(G)≥…≥λn(G), with λn(G) referred to as the least distance eigenvalue of G. In this paper, we give the maximum value of the least distance eigenvalue, and determine the unique extremal graph with two pendant vertices whose complements attain the value.
Förderung
- Natural Science Foundation of Xinjiang Uygur Autonomous Region
- Natural Science Foundation of Guangxi province
- Science and Technology Project of Guangxi
Zitieren
APA
Zhang, J., Chen, X., Deng, J., Li, S., Li, G., & Hua, L. (2026). The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices. Mathematics, 14(15), 2708. https://doi.org/10.3390/math14152708
Vancouver
Zhang J, Chen X, Deng J, Li S, Li G, Hua L. The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices. Mathematics. 2026;14(15):2708. doi:10.3390/math14152708
BibTeX
@article{Zhang2026,
author = {Zhang, Jinfeng and Chen, Xu and Deng, Jiawen and Li, Shuo and Li, Guodong and Hua, Liyan},
title = {The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {15},
pages = {2708},
doi = {10.3390/math14152708}
}
EUVIMED