• Corpus ID: 236956695

The signless Laplacian spectral radius of graphs without intersecting odd cycles

@inproceedings{Chen2021TheSL,
  title={The signless Laplacian spectral radius of graphs without intersecting odd cycles},
  author={Ming-Zhu Chen and A-Ming Liu and Xiaodong Zhang},
  year={2021}
}
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. AMS Classification: 05C50… 
The spectral radius of graphs with no intersecting odd cycles
Spectral extremal graphs for intersecting cliques
A survey on spectral conditions for some extremal graph problems
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur´an type problems in graph theory. More precisely, we shall summarize the spectral Tur´an function in

References

SHOWING 1-10 OF 25 REFERENCES
On the spectral radius of graphs without a star forest
Maxima of the Q-index: graphs without long paths
This paper gives tight upper bound on the largest eigenvalue q(G) of the signless Laplacian of graphs with no paths of given order. The main ingredient of our proof is a stability result of its own
Spectral Extremal Results with Forbidding Linear Forests
TLDR
The maximum spectral radius of all graphs without a linear forest as a subgraph and all the extremal graphs are determined and some relations between Turán type extremal problems and their spectral counterparts are discussed.
A note on Laplacian graph eigenvalues
Turán number and decomposition number of intersecting odd cycles
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs
TLDR
This paper determines the graphs of order n that have the maximum (adjacency) spectral radius among all graphs containing no F_k, for n sufficiently large.
Erdős-Gallai stability theorem for linear forests
...
...