Graphs of given order and size and minimum algebraic connectivity
MetadataTüm öğe kaydını göster
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.