| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600488 | Linear Algebra and its Applications | 2012 | 11 Pages |
Abstract
The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal cliques of size 2 or larger is derived.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
