The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree

Ejemplares similares

• Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
  por: Lin, Jifu, et al.
  Publicado: (2024)
• On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
  por: Xu, Zengzhao, et al.
  Publicado: (2023)
• The existence of a $\{P_{2},C_{3},P_{5},\mathcal{T}(3)\}$-factor based on the size or the $A_α$-spectral radius of graphs
  por: Zhang, Xianglong, et al.
  Publicado: (2024)
• Spectral radius and homeomorphically irreducible spanning trees of graphs
  por: Gao, Bingqian, et al.
  Publicado: (2025)
• Spanning k-trees and distance spectral radius in graphs
  por: Zhou, Sizhong, et al.
  Publicado: (2023)