Graphs of Given Order and Size and Minimum Algebraic Connectivity

Türker Biyikoglu; Josef Leydold

doi:10.1016/j.laa.2011.09.026

Graphs of Given Order and Size and Minimum Algebraic Connectivity

Türker Biyikoglu, Josef Leydold

Publikation: Working/Discussion Paper › WU Working Paper

35 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.

Originalsprache	Englisch
DOIs	https://doi.org/10.1016/j.laa.2011.09.026
Publikationsstatus	Veröffentlicht - 1 Dez. 2011

Publikationsreihe

Reihe	Research Report Series / Department of Statistics and Mathematics
Nummer	115

WU Working Paper Reihe

Research Report Series / Department of Statistics and Mathematics

Zugriff auf Dokument

10.1016/j.laa.2011.09.026Lizenz: Nicht angegeben

Techreport-115Endgültige, publizierte Fassung, 382 KBLizenz: Sonstige

Verfügbarkeit prüfen

Katalog der Universitätsbibliothek

13 Zitationen
1 Originalbeitrag in Fachzeitschrift

Graphs of given order and size and minimum algebraic connectivity
Leydold, J. & Bıyıkoğlu, T., 1 Aug. 2012, in: Linear Algebra and Its Applications. 436, 7, S. 2067 - 2077
Publikation: Wissenschaftliche Fachzeitschrift › Originalbeitrag in Fachzeitschrift › Begutachtung

Zitat

@techreport{c4115c3b819f46d28770da032c6edffe,

title = "Graphs of Given Order and Size and Minimum Algebraic Connectivity",

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.",

author = "T{\"u}rker Biyikoglu and Josef Leydold",

year = "2011",

month = dec,

day = "1",

doi = "10.1016/j.laa.2011.09.026",

language = "English",

series = "Research Report Series / Department of Statistics and Mathematics",

number = "115",

type = "WorkingPaper",

}

TY - UNPB

T1 - Graphs of Given Order and Size and Minimum Algebraic Connectivity

AU - Biyikoglu, Türker

AU - Leydold, Josef

PY - 2011/12/1

Y1 - 2011/12/1

N2 - 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.

AB - 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.

U2 - 10.1016/j.laa.2011.09.026

DO - 10.1016/j.laa.2011.09.026

M3 - WU Working Paper

T3 - Research Report Series / Department of Statistics and Mathematics

BT - Graphs of Given Order and Size and Minimum Algebraic Connectivity

ER -

Graphs of Given Order and Size and Minimum Algebraic Connectivity

Abstract

Publikationsreihe

WU Working Paper Reihe

Zugriff auf Dokument

Verfügbarkeit prüfen

Andere Versionen dieses Inhalts

Graphs of given order and size and minimum algebraic connectivity

Zitat