Maximum degree and spectral radius of graphs in terms of size
From MaRDI portal
(Redirected from Publication:6154430)
Abstract: Research on the relationship of the (signless Laplacian) spectral radius of a graph with its structure properties is an important research project in spectral graph theory. Denote by and the spectral radius and the signless Laplacian spectral radius of a graph , respectively. Let be a fixed integer and be a graph of size which is large enough. We show that if , then or . Furthermore, we prove that if , then . Both these two results extend some known results.
Recommendations
- Spectral radius of graphs of given size with forbidden subgraphs
- A note on the signless Laplacian spectral ordering of graphs with given size
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)
Cites work
- A spectral version of Mantel's theorem
- Bounds on graph eigenvalues. II
- Bounds on the index of the signless Laplacian of a graph
- Eigenvalues and triangles in graphs
- Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Maxima of the \(Q\)-index: forbidden even cycles
- Maxima of the \(Q\)-index: forbidden odd cycles
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Signless Laplacian spectral radii of graphs with given chromatic number
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The maximum spectral radius of C₄-free graphs of given order and size
- The maximum spectral radius of graphs without friendship subgraphs
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- The spectral radius of graphs without paths and cycles of specified length
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Über ein Problem von K. Zarankiewicz
- Which graphs are determined by their spectrum?
Cited in
(8)- Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)
- Spectral radius of graphs of given size with forbidden subgraphs
- Spectral radius of graphs with given size and odd girth
- A spectral stability result regarding the complete bipartite graph \(K_{2,t}\)
- Signless Laplacian spectral conditions for extremal quadrilateral and star embeddings
- Spectral radius of weighted adjacency matrix of trees based on Balaban index
- Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs
- Spectral extremal graphs for fan graphs
This page was built for publication: Maximum degree and spectral radius of graphs in terms of size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154430)