Graphs with given diameter maximizing the spectral radius
From MaRDI portal
Publication:996301
DOI10.1016/j.laa.2007.05.026zbMath1122.05063OpenAlexW2120651585MaRDI QIDQ996301
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
Related Items (20)
On the zero forcing number and spectral radius of graphs ⋮ Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter ⋮ Graphs with given diameter maximizing the algebraic connectivity ⋮ The minimal spectral radius of graphs with a given diameter ⋮ The maximum Perron roots of digraphs with some given parameters ⋮ Disproof of a conjecture on the minimum spectral radius and the domination number ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ Maximizing the spectral radius of \(k\)-connected graphs with given diameter ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Unnamed Item ⋮ Conjugate Laplacian matrices of a graph ⋮ Effective graph resistance ⋮ On the spectral radius of bipartite graphs with given diameter ⋮ On the maximum spectral radius of multipartite graphs ⋮ Maximizing the Laplacian spectral radii of graphs with given diameter ⋮ Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Maximizing the spectral radius of bicyclic graphs with fixed girth ⋮ Asymptotic results on the spectral radius and the diameter of graphs ⋮ Eigenvalue interlacing and weight parameters of graphs
Cites Work
This page was built for publication: Graphs with given diameter maximizing the spectral radius