The spread of the unicyclic graphs

Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two sharp bounds of the spread s(G) of G. AMS classification: 05C50 ,05C35 Key words: Unicyclic graph; Spread; Largest eigenvalue; Least eigenvalue.

• Type: Journal
• Year: 2010
• Where: EJC
• Authors: Yarong Wu, Jinlong Shu
• Keywords: Eigenvalue, EJC 2007, EJC 2010, Simple Connected Graph, Unicyclic Graph