2000 character limit reached
Graphs of order $n$ and diameter $2(n-1)/3$ minimizing the spectral radius (1405.5015v1)
Published 20 May 2014 in math.SP and math.CO
Abstract: The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for $d\in{1,2}\cup [n/2,2n/3-1]\cup{n-k\mid k=1,2,...,8}$. In this paper, we determine all minimizer graphs for $d=2(n-1)/3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.