arXiv Analytics

Sign in

arXiv:1602.05922 [math.CO]AbstractReferencesReviewsResources

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Sebastian M. Cioabă, Xiaofeng Gu

Published 2016-02-18Version 1

In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.

Comments: 13 pages; accepted to Czechoslovak Mathematical Journal, special issue dedicated to Professor Miroslav Fiedler
Categories: math.CO, cs.DM
Subjects: 05C50, 05C40, 05C42, 05E99, 05C05, 15A18
Related articles: Most relevant | Search more
arXiv:math/0407274 [math.CO] (Published 2004-07-15, updated 2005-08-12)
On the extreme eigenvalues of regular graphs
arXiv:0909.3910 [math.CO] (Published 2009-09-22)
Note on the energy of regular graphs
arXiv:1901.05594 [math.CO] (Published 2019-01-17)
Queue Layouts of Graphs with Bounded Degree and Bounded Genus

Links

Toolbox