Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647841 | Discrete Mathematics | 2012 | 14 Pages |
Abstract
The problem of identifying those simple, undirected graphs with nn vertices and kk edges that have the smallest minimum eigenvalue of the adjacency matrix is considered. Several general properties of the minimizing graphs are described. These strongly suggest bipartition, to the extent possible for the number of edges. In the bipartite case, the precise structure of the minimizing graphs is given for a number of infinite classes.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Charles R. Johnson, Aneta Sawikowska,