A lower bound for the spectral radius of graphs with fixed diameter
From MaRDI portal
Publication:992783
Recommendations
- Asymptotic results on the spectral radius and the diameter of graphs
- Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
- Spectral radius of graph with given diameter.
- The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
- Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Asymptotic results on the spectral radius and the diameter of graphs
- Asymptotically large (\(\Delta,D\))-graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Problems in algebraic combinatorics
- Spectral Radius and Degree Sequence
- The minimal spectral radius of graphs with a given diameter
- The spectral radius and the maximum degree of irregular graphs
- Walks and the spectral radius of graphs
Cited in
(16)- An Optimal Lower Bound for the Size of Periodic Digraphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Graphs with the minimum spectral radius for given independence number
- A new result on spectral radius and maximum degree of irregular graphs
- A note on spectral radius and maximum degree of irregular graphs
- A note on spectral radius and degree deviation in graphs
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- Asymptotic results on the spectral radius and the diameter of graphs
- Eigenvalues and triangles in graphs
- The non-bipartite integral graphs with spectral radius three
- The minimal spectral radius of graphs with a given diameter
- An extremal problem for the spectral radius of a graph
- A lower bound on the diameter of the flip graph
- Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius
- Lower bounds for the spectral norm of digraphs
This page was built for publication: A lower bound for the spectral radius of graphs with fixed diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992783)