Loading...
Minimizing the least eigenvalue of graphs with fixed order and size
Sawikowska, Aneta Johnson, Charles R.
Sawikowska, Aneta
Johnson, Charles R.
Abstract
The problem of identifying those simple, undirected graphs with n vertices and k 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. (C) 2012 Elsevier B.V. All rights reserved.
Description
Date
2012-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Advisor
Department
Mathematics
DOI
10.1016/j.disc.2012.03.033