Graphs of Given Order and Size and Minimum Algebraic Connectivity

Türker Biyikoglu, Josef Leydold

Publikation: Working/Discussion PaperWU Working Paper

21 Downloads (Pure)

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
DOIs
PublikationsstatusVeröffentlicht - 1 Dez. 2011

Publikationsreihe

ReiheResearch Report Series / Department of Statistics and Mathematics
Nummer115

WU Working Paper Reihe

  • Research Report Series / Department of Statistics and Mathematics

Zitat