TY  - JOUR
AU  - Xin, Jihan
AU  - Kang, Huixin
AU  - He, Qi
AU  - Fan, Dandan
PY  - 2026
TI  - Distance spectral radius and    [  a  ,  b  ]-factor of graphs
JO  - AIMS Mathematics
SP  - 12360
EP  - 12372
VL  - 11
IS  - 5
AB  - Let    H be a spanning subgraph of    G. If every vertex    v  ∈  V  (  G  ) satisfies    a  ≤      d          H        (  v  )  ≤  b, then    H is called an    [  a  ,  b  ]-factor of    G. In 2005, Brouwer and Haemers pioneered the spectral approach for investigating    1-factors in regular graphs. Since this work, adjacency eigenvalue conditions for    [  a  ,  b  ]-factors have been extensively studied. In this paper, we provided some conditions based on the distance spectral radius that ensured the existence of an    [  a  ,  b  ]-factor in a connected graph and a balanced bipartite graph, respectively.
UR  - https://doi.org/10.3934/math.2026507
DO  - 10.3934/math.2026507