Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius
From MaRDI portal
Publication:498316
DOI10.1016/j.laa.2015.08.015zbMath1327.05166arXiv1405.5015MaRDI QIDQ498316
Publication date: 28 September 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.5015
05C35: Extremal problems in graph theory
05E99: Algebraic combinatorics
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
94C15: Applications of graph theory to circuits and networks
Related Items
Quipu quivers and Nakayama algebras with almost separate relations, On the divisibility of H-shape trees and their spectral determination
Cites Work
- Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
- The minimal spectral radius of graphs with a given diameter
- The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
- Asymptotic results on the spectral radius and the diameter of graphs
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- Graphs with diameter \(n - e\) minimizing the spectral radius
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item