English

Spectral radius and homeomorphically irreducible spanning trees of graphs

Combinatorics 2025-09-03 v1

Abstract

For a connected graph GG, a spanning tree TT of GG is called a homeomorphically irreducible spanning tree (HIST) if TT has no vertices of degree 2. Albertson {\em et al.} proved that it is NPNP-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 GG to ensure the existence of a HIST in GG.

Keywords

Cite

@article{arxiv.2509.02021,
  title  = {Spectral radius and homeomorphically irreducible spanning trees of graphs},
  author = {Bingqian Gao and Huiqing Liu and Jing Zhao},
  journal= {arXiv preprint arXiv:2509.02021},
  year   = {2025}
}

Comments

15 pages, 6 figures