A sharp upper bound on the spectral radius of θ(1,3,3)-free graphs with given size
Filomat · 2025 · 39 (33) · 11969-11980
DOI: 10.2298/fil2533969l ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Yuxiang Liu und 1 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
A graph G is F-free if G does not contain F as a subgraph. Let ρ(G) be the spectral radius of a graph G. Let θ(1,p,q) denote the theta graph, which is obtained by connecting two distinct vertices with three internally disjoint paths with lengths 1, p, q, where p ≤ q. Let S_{n,k} denote the graph obtained by joining every vertex of K_k to n-k isolated vertices and S_{n,k}^{-} denote the graph obtained from S_{n,k} by deleting an edge incident to a vertex of degree k, respectively. In this paper, we show that if ρ(G)≥ \rho(G) \ge \rho(S_{\frac{m+4}{2}, 2}^{-}) for a graph G with even size m ≥ 92, then G contains a θ(1, 3, 3) unless G \cong S_{\frac{m+4}{2}, 2}^{-} .
Zitieren
APA
Liu, Y., & Wang, L. (2025). A sharp upper bound on the spectral radius of θ(1,3,3)-free graphs with given size. Filomat, 39(33), 11969-11980. https://doi.org/10.2298/fil2533969l
Vancouver
Liu Y, Wang L. A sharp upper bound on the spectral radius of θ(1,3,3)-free graphs with given size. Filomat. 2025;39(33):11969-11980. doi:10.2298/fil2533969l
BibTeX
@article{Liu2025,
author = {Liu, Yuxiang and Wang, Ligong},
title = {A sharp upper bound on the spectral radius of θ(1,3,3)-free graphs with given size},
journal = {Filomat},
year = {2025},
volume = {39},
number = {33},
pages = {11969--11980},
doi = {10.2298/fil2533969l}
}
EUVIMED