Graph Limits and Spectral Extremal Problems for Graphs
From MaRDI portal
Publication:6188518
DOI10.1137/22M1508807OpenAlexW4391377637WikidataQ128936314 ScholiaQ128936314MaRDI QIDQ6188518FDOQ6188518
Authors: Lele Liu
Publication date: 7 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m1508807
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35)
Cites Work
- Large networks and graph limits
- The Rotation of Eigenvectors by a Perturbation. III
- On a conjecture of V. Nikiforov
- Eigenvalue bounds for the signless laplacian
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- The Laplacian spread of graphs.
- Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues
- On the Laplacian spread of graphs
- A survey of Nordhaus-Gaddum type relations
- On Complementary Graphs
- The signless Laplacian spread
- The spread of the unicyclic graphs
- A survey of automated conjectures in spectral graph theory
- On the spread of the spectrum of a graph
- The spread of the spectrum of a graph
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Edge bipartiteness and signless Laplacian spread of graphs
- Proof of a conjecture of V. Nikiforov
- Upper Bounds on the Order of a Clique of a Graph
- Eigenvalue problems of Nordhaus--Gaddum type
- Bounds on the \(Q\)-spread of a graph
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Title not available (Why is that?)
- The spread of unicyclic graphs with given size of maximum matchings
- Open problems on graph eigenvalues studied with AutoGraphiX
- Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
- Maximum spread of graphs and bipartite graphs
Cited In (1)
This page was built for publication: Graph Limits and Spectral Extremal Problems for Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188518)