Graphs with given diameter maximizing the spectral radius
From MaRDI portal
Publication:996301
DOI10.1016/J.LAA.2007.05.026zbMATH Open1122.05063OpenAlexW2120651585MaRDI QIDQ996301FDOQ996301
Publication date: 14 September 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/853289/VANDAM31_srmaxdiam.pdf
Cites Work
Cited In (27)
- The maximum Perron roots of digraphs with some given parameters
- Effective graph resistance
- On the spectral radius of bipartite graphs with given diameter
- Maximizing the spectral radius of bicyclic graphs with fixed girth
- The maximum spectral radius of wheel-free graphs
- Graphs with given degree sequence and maximal spectral radius
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Eigenvalue interlacing and weight parameters of graphs
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- Asymptotic results on the spectral radius and the diameter of graphs
- The minimal spectral radius of graphs with a given diameter
- The maximum spectral radius of graphs without friendship subgraphs
- Maximizing the Laplacian spectral radii of graphs with given diameter
- Maximizing the spectral radius of \(k\)-connected graphs with given diameter
- Disproof of a conjecture on the minimum spectral radius and the domination number
- The maximum spectral radius of graphs of given size with forbidden subgraph
- Graphs with the minimum spectral radius for given independence number
- Graphs with given diameter maximizing the algebraic connectivity
- THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
- Title not available (Why is that?)
- Constructing graphs with given spectrum and the spectral radius at most 2
- On the maximum spectral radius of multipartite graphs
- On the zero forcing number and spectral radius of graphs
- The maximum radius of graphs with given order and minimum degree
- Conjugate Laplacian matrices of a graph
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
This page was built for publication: Graphs with given diameter maximizing the spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996301)