Graphs of Given Order and Size and Minimum Algebraic Connectivity

Türker Biyikoglu, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

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.
Original languageEnglish
DOIs
Publication statusPublished - 1 Dec 2011

Publication series

NameResearch Report Series / Department of Statistics and Mathematics
No.115

WU Working Paper Series

  • Research Report Series / Department of Statistics and Mathematics

Cite this