Detailed Record


Spectral Turán problems for intersecting even cycles


Abstract Let C2k1,2k2,…,2kt denote the graph obtained by intersecting t distinct even cycles C2k1,C2k2,…,C2kt at a unique vertex. In this paper, we determine the unique graph with maximum adjacency spectral radius among all graphs on n vertices that do not contain any C2k1,2k2,…,2kt as a subgraph, for n sufficiently large. When one of the constituent even cycles is a C4, our results improve upper bounds on the Turán numbers for intersecting even cycles that follow from more general results of Füredi [21] and Alon, Krivelevich and Sudakov [1]. Our results may be seen as extensions of previous results for spectral Turán problems on forbidden even cycles C2k,k≥2 (see [8], [36], [46], [47]).
Authors Dheer Noal Desai University of WyomingORCID
Journal Info Elsevier BV | Linear Algebra and its Applications , vol: 683 , pages: 46 - 70
Publication Date 2/1/2024
ISSN 0024-3795
TypeKeyword Image article
Open Access closed Closed Access
DOI https://doi.org/10.1016/j.laa.2023.11.018
KeywordsKeyword Image Graph Limits (Score: 0.566162) , Distance-Regular Graphs (Score: 0.510258) , Graph Spectra (Score: 0.502707)