2021/08/09 by Chen, Ming-Zhu, Liu, A-Ming, Zhang, Xiao-Dong · 1 citation
#05C35 #05C50 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2108.03895
Let Fa1,…,ak be a graph consisting of k cycles of odd length 2a1+1,…, 2ak+1, respectively which intersect in exactly a common vertex, where k≥1 and a1≥ a2≥ ⋯≥ ak≥ 1. In this paper, we present a sharp upper bound for the signless Laplacian spectral radius of all Fa1,…,ak-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.