The signless Laplacian spectral radius of graphs without intersecting odd cycles
The Electronic Journal of Linear Algebra · 16.04.2024 · 40 · 370-381
DOI: 10.13001/ela.2024.8149 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 16.04.2024. Verfasst von Ming-Zhu Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref).
Abstract (Originalsprache)
Let $F_{a_1,\dots,a_k}$ be a graph consisting of $k$ cycles of odd length $2a_1+1,\dots, 2a_k+1,$ respectively, which intersect in exactly one common vertex, where $k\geq1$ and $a_1\ge a_2\ge \cdots\ge a_k\ge 1$. In this paper, we present a sharp upper bound for the signless Laplacian spectral radius of all $F_{a_1,\dots,a_k}$-free graphs and characterize all extremal graphs which attain the bound. The stability methods and structure of graphs associated with the eigenvalue are adapted for the proof.
Zitieren
APA
Chen, M., Liu, A., & Zhang, X. (2024). The signless Laplacian spectral radius of graphs without intersecting odd cycles. The Electronic Journal of Linear Algebra, 40, 370-381. https://doi.org/10.13001/ela.2024.8149
Vancouver
Chen M, Liu A, Zhang X. The signless Laplacian spectral radius of graphs without intersecting odd cycles. The Electronic Journal of Linear Algebra. 2024;40:370-381. doi:10.13001/ela.2024.8149
BibTeX
@article{Chen2024,
author = {Chen, Ming-Zhu and Liu, A-Ming and Zhang, Xiaodong},
title = {The signless Laplacian spectral radius of graphs without intersecting odd cycles},
journal = {The Electronic Journal of Linear Algebra},
year = {2024},
volume = {40},
pages = {370--381},
doi = {10.13001/ela.2024.8149}
}
EUVIMED