The minimal spectral radius of graphs with a given diameter
From MaRDI portal
Publication:880046
DOI10.1016/j.laa.2007.01.011zbMath1115.05057OpenAlexW3122885509MaRDI QIDQ880046
van Dam, Edwin R., Robert E. Kooij
Publication date: 10 May 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/78a07581-fdbb-49f5-84fb-4efc5899a543
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)
Related Items
Degree distribution and assortativity in line graphs of complex networks ⋮ Biregular graphs with three eigenvalues ⋮ Connected hypergraphs with small spectral radius ⋮ Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\) ⋮ Disproof of a conjecture on the minimum spectral radius and the domination number ⋮ Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ On the maximal α-spectral radius of graphs with given matching number ⋮ Unicyclic graphs of minimal spectral radius ⋮ Graph spectra in computer science ⋮ The minimum spectral radius of graphs with a given domination number ⋮ Kemeny's constant for several families of graphs and real-world networks ⋮ On the divisibility of H-shape trees and their spectral determination ⋮ Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number ⋮ Spectral radius of digraphs with given dichromatic number ⋮ The \(A_{\alpha}\) spectral radius characterization of some digraphs ⋮ The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\) ⋮ Open quipus with the same Wiener index as their quadratic line graph ⋮ Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius ⋮ Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\) ⋮ On the \(A_\alpha\)-spectral radius of a graph ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Semiregular trees with minimal Laplacian spectral radius ⋮ Graphs with diameter \(n - e\) minimizing the spectral radius ⋮ Trees with minimal index and diameter at most four ⋮ A lower bound for the spectral radius of graphs with fixed diameter ⋮ Graphs with given diameter maximizing the spectral radius ⋮ On the spectral radius of bipartite graphs with given diameter ⋮ The least eigenvalue of graphs with given connectivity ⋮ A note on the spectral characterization of dumbbell graphs ⋮ MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS ⋮ The minimum spectral radius of graphs with a given independence number ⋮ The spectral radius of graphs with given independence number ⋮ Asymptotic results on the spectral radius and the diameter of graphs ⋮ A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectral radius of trees with fixed diameter
- Graphs with given diameter maximizing the spectral radius
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- On Moore Graphs with Diameters 2 and 3
- Spectral Radius and Degree Sequence
- Some large graphs with given degree and diameter
- Performance Analysis of Communications Networks and Systems
This page was built for publication: The minimal spectral radius of graphs with a given diameter
