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

生成讲解博客的中文版本

生成AI智能校验的中文版本