The signless Laplacian spectral radius of graphs without intersecting odd cycles
From MaRDI portal
Publication:6628846
DOI10.13001/ela.2024.8149MaRDI QIDQ6628846
Aming Liu, Xiao Dong Zhang, Ming-Zhu Chen
Publication date: 29 October 2024
Published in: ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)
extremal graphsignless Laplacian spectral radiusBrualdi-Solheid-Turán-type problemintersecting odd cycles free
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- A contribution to the Zarankiewicz problem
- The spectral radius of graphs without paths and cycles of specified length
- A note on Laplacian graph eigenvalues
- Erdős-Gallai stability theorem for linear forests
- Spectral extremal results with forbidding linear forests
- Maximizing the sum of the squares of the degrees of a graph
- Extremal graphs for intersecting triangles
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- The spectral radius of graphs with no intersecting odd cycles
- The maximum spectral radius of graphs without friendship subgraphs
- Maxima of the \(Q\)-index: forbidden odd cycles
- Maxima of the \(Q\)-index: forbidden even cycles
- Turán number and decomposition number of intersecting odd cycles
- Sharp bounds on the spectral radius of a nonnegative matrix
- Bounds on graph eigenvalues. II
- On the spectral radius of graphs without a star forest
- Some new results in extremal graph theory
- On maximal paths and circuits of graphs
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Extremal graphs for the k‐flower
- Maxima of the Q-index: graphs without long paths
- Some Theorems on Abstract Graphs
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
Related Items (1)
This page was built for publication: The signless Laplacian spectral radius of graphs without intersecting odd cycles
