Graphs with Diameter $n-e$ Minimizing the Spectral Radius

Details Graphs with Diameter $n-e$ Minimizing the Spectral Radius Graphs with Diameter $n-e$ Minimizing the Spectral Radius

2011-10-11

arxiv.org/abs/1110.2444v1

Mathematics

Combinatorics

Scientific paper

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices with diameter $n-e$. Let $P_{n_1,n_2,...,n_t,p}^{m_1,m_2,...,m_t}$ be a tree obtained from a path of $p$ vertices ($0 \sim 1 \sim 2 \sim ... \sim (p-1)$) by linking one pendant path $P_{n_i}$ at $m_i$ for each $i\in\{1,2,...,t\}$. For $e=1,2,3,4,5$, $G^{min}_{n,n-e}$ were determined in the literature. Cioab\v{a}-van Dam-Koolen-Lee \cite{CDK} conjectured for fixed $e\geq 6$, $G^{min}_{n,n-e}$ is in the family ${\cal P}_{n,e}=\{P_{2,1,...1,2,n-e+1}^{2,m_2,...,m_{e-4},n-e-2}\mid 2

Affiliated with

Also associated with

No associations

Rating

Graphs with Diameter $n-e$ Minimizing the Spectral Radius does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs with Diameter $n-e$ Minimizing the Spectral Radius, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs with Diameter $n-e$ Minimizing the Spectral Radius will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472419