Learn More
  • Francis K Bell, Dragoš Cvetkovi´c, Peter Rowlinson, Slobodan K Simi´c, S K Simi´c
  • 2008
Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs of prescribed order and size. We show first that either G is complete or λ(G) is a simple eigenvalue. In the latter case, the sign pattern of a corresponding eigenvector determines a partition of the vertex set, and we study the structure of G in terms of this(More)