Spectral radius and homeomorphically irreducible spanning trees of graphs
Abstract
For a connected graph G, a spanning tree T of G is called a homeomorphically irreducible spanning tree (HIST) if T has no vertices of degree 2. Albertson et al. proved that it is NP-complete to decide whether a graph contains a HIST. In this paper, we provide some spectral conditions that guarantee the existence of a HIST in a connected graph. Furthermore, we also present some sufficient conditions in terms of the order of a graph G to ensure the existence of a HIST in G.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.