2000 character limit reached
    
  Spectral radius and homeomorphically irreducible spanning trees of graphs (2509.02021v1)
    Published 2 Sep 2025 in math.CO
  
  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 {\em 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.