Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
classification
🧮 math.CO
cs.DM
keywords
boundedconnectivitydegreeregularspanningspectrumtoughnesstrees
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.