Graphs of given order and size and minimum algebraic connectivity

Josef Leydold; Türker B&#305;y&#305;ko&#287;lu

Graphs of given order and size and minimum algebraic connectivity

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

Publication: Scientific journal › Journal article › peer-review

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 language	English
Pages (from-to)	2067 - 2077
Journal	Linear Algebra and Its Applications
Volume	436
Issue number	7
Publication status	Published - 1 Aug 2012

Check availability

University Library Catalogue

1 WU Working Paper

Graphs of Given Order and Size and Minimum Algebraic Connectivity
Biyikoglu, T. & Leydold, J., 1 Dec 2011, (Research Report Series / Department of Statistics and Mathematics; No. 115).
Publication: Working/Discussion Paper › WU Working Paper

Open Access
File

10 Downloads (Pure)

Cite this

@article{36706c9dd9cc48a4b597f5a0de73bb97,

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 = "Josef Leydold and T{\"u}rker Bıyıkoğlu",

year = "2012",

month = aug,

day = "1",

language = "English",

volume = "436",

pages = "2067 -- 2077",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "7",

}

TY - JOUR

T1 - Graphs of given order and size and minimum algebraic connectivity

AU - Leydold, Josef

AU - Bıyıkoğlu, Türker

PY - 2012/8/1

Y1 - 2012/8/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.

M3 - Journal article

SN - 0024-3795

VL - 436

SP - 2067

EP - 2077

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - 7

ER -

Graphs of given order and size and minimum algebraic connectivity

Abstract

Check availability

Other versions

Graphs of Given Order and Size and Minimum Algebraic Connectivity

Cite this