Graphs of given order and size and minimum algebraic connectivity

Josef Leydold, Türker Bıyıkoğlu

Publikation: Wissenschaftliche FachzeitschriftOriginalbeitrag in FachzeitschriftBegutachtung

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.
OriginalspracheEnglisch
Seiten (von - bis)2067 - 2077
FachzeitschriftLinear Algebra and Its Applications
Jahrgang436
Ausgabenummer7
PublikationsstatusVeröffentlicht - 1 Aug. 2012

Dieses zitieren