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) / Series: Research Report Series / Department of Statistics and Mathematics
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:3296 |
| Date | 10 1900 |
| Creators | Biyikoglu, TĂĽrker, Leydold, Josef |
| Publisher | WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Paper, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://dx.doi.org/10.1016/j.laa.2011.09.026, http://epub.wu.ac.at/3296/ |
Page generated in 0.0021 seconds