Asymptotic results on the spectral radius and the diameter of graphs (Q1044563): Difference between revisions

The authors study the minimal value of the spectral radius of the adjacency matrix of graphs with \(n\) vertices and diameter \(D\). They determine extremal graphs of that kind for \(D\in\{(n+1)/2, (n+2)/2, (n+3)/2, (n+4)/2\}\), then for \(D\in\{n-4,n-5\}\) and \(D=(n-e)/2\) with fixed \(e\geq 2\) (all these for sufficiently large \(n\)). They also revise the conjecture of \textit{E. R. van Dam} and \textit{R. E. Kooij} [``The minimal spectral radius of graphs with a given diameter,'' Linear Algebra Appl. 423, No. 2--3, 408--419 (2007; Zbl 1115.05057)] for \(D=n-e\) for fixed \(e\geq 5\). In obtaining these results, the authors have also studied the limit points of sequences of spectral radii of certain types of graphs, which are related to open and closed quipus and daggers of \textit{R. Woo} and \textit{A. Neumaier} [``On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\),'' Graphs Comb. 23, No. 6, 713--726 (2007; Zbl 1155.05045)].