Graphs of Given Order and Size and Minimum Algebraic Connectivity

Biyikoglu, Türker and Leydold, Josef (2011) Graphs of Given Order and Size and Minimum Algebraic Connectivity. Research Report Series / Department of Statistics and Mathematics, 115. WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
techreport-115.pdf

Download (390kB)

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's abstract)

Item Type: Paper
Additional Information: This paper has been published in Linear Algebra and its Application (2012), http://dx.doi.org/10.1016/j.laa.2011.09.026. Access to the published version may require a subscription.
Keywords: algebraic connectivity / graph Laplacian / Fiedler vector / AutoGraphiX
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Josef Leydold
Date Deposited: 30 Nov 2011 15:31
Last Modified: 22 Oct 2019 00:41
FIDES Link: https://bach.wu.ac.at/d/research/results/56816/
URI: https://epub.wu.ac.at/id/eprint/3296

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics