\input zb-basic
\input zb-ioport
\iteman{io-port 05551595}
\itemau{Guo, Shu-Guang}
\itemti{On the spectral radius of unicyclic graphs with $n$ vertices and edge independence number $q$.}
\itemso{Ars Comb. 83, 279-287 (2007).}
\itemab
The largest eigenvalue of a graph $G$ is called the spectral radius of $G$, denoted $\rho (G)$. It is shown that among all unicyclic graphs $G$ with $n$ vertices and edge independence number (matching number) $q$, the maximum value of $\rho (G)$ is achieved uniquely if $G$ is the graph obtained from the triangle $C_3$ by attaching $n-2q+1$ pendant edges and $q-2$ paths of length 2 to one of its vertices.
\itemrv{Zden\v ek Ryj\'a\v cek (Plze\v n)}
\itemcc{}
\itemut{unicyclic graph; eigenvalue; spectral radius; edge independence number}
\itemli{}
\end