Tricyclic graphs with the second largest distance eigenvalue less than −12
Discrete Applied Mathematics · 2026-10 · 391 · 137-145
DOI: 10.1016/j.dam.2026.04.039 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Kexin Yang und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Let $G$ be a simple connected graph with vertex set $V(G)=\{v_{1}, v_{2}, \ldots, v_{n}\}$. The distance $d_G(v_i,v_j)$ between two vertices $v_i$ and $v_j$ of $G$ is the length of a shortest path between $v_i$ and $v_j$. The distance matrix of $G$ is defined as $D(G)=(d_G(v_i,v_j))_{n\times n}$. The second largest distance eigenvalue of \( G \) is the second largest eigenvalues of $D(G)$. Guo and Zhou [Discrete Math. 347(2024), 114082] proved that any connected graph with the second largest distance eigenvalue less than $-\frac{1}{2}$ is chordal, and characterize all bicyclic graphs and split graphs with the second largest distance eigenvalue less than $-\frac{1}{2}$. Based on this, we characterize all tricyclic graphs with the second largest distance eigenvalue less than $-\frac{1}{2}$.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Yang, K., & Wang, L. (2026). Tricyclic graphs with the second largest distance eigenvalue less than −12. Discrete Applied Mathematics, 391, 137-145. https://doi.org/10.1016/j.dam.2026.04.039
Vancouver
Yang K, Wang L. Tricyclic graphs with the second largest distance eigenvalue less than −12. Discrete Applied Mathematics. 2026;391:137-145. doi:10.1016/j.dam.2026.04.039
BibTeX
@article{Yang2026,
author = {Yang, Kexin and Wang, Ligong},
title = {Tricyclic graphs with the second largest distance eigenvalue less than −12},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {391},
pages = {137--145},
doi = {10.1016/j.dam.2026.04.039}
}
EUVIMED