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]](http://epub.wu.ac.at/style/images/fileicons/application_pdf.png)
|
PDF
Download (381Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.laa.2011.09.026
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 16:31 |
| Last Modified: | 20 Feb 2012 13:22 |
| FIDES Link: | http://bach.wu.ac.at/bachapp/cgi-bin/fides/fides.a... |
| URI: | http://epub.wu.ac.at/id/eprint/3296 |
Actions
| View Item Details |
