Back to Search
Start Over
Minimizing the least eigenvalue of graphs with fixed order and size
- Source :
- Discrete Mathematics. 312:2272-2285
- Publication Year :
- 2012
- Publisher :
- Elsevier BV, 2012.
-
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.
- Subjects :
- Bipartite graph
Single additional row matrix
Discrete mathematics
Dense graph
Matching (graph theory)
Adjacency matrix
Two-graph
Graph theory
Perron root
Theoretical Computer Science
Metric dimension
Combinatorics
Singular value
Indifference graph
Chordal graph
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
Triangle-free graph
Discrete Mathematics and Combinatorics
Minimum eigenvalue
MathematicsofComputing_DISCRETEMATHEMATICS
Mathematics
Subjects
Details
- ISSN :
- 0012365X
- Volume :
- 312
- Database :
- OpenAIRE
- Journal :
- Discrete Mathematics
- Accession number :
- edsair.doi.dedup.....61faf531ab312c927ad0e89a1c9f6790