@article{Xin2026, 
author = {Jihan Xin and Huixin Kang and Qi He and Dandan Fan},
title = {Distance spectral radius and    [  a  ,  b  ]-factor of graphs},
year = {2026},
journal = {AIMS Mathematics},
volume = {11},
number = {5},
pages = {12360-12372},
keywords = {perfect matching, [a, b]-factor, distance spectral radius},
url = {https://www.sciopen.com/article/10.3934/math.2026507},
doi = {10.3934/math.2026507},
abstract = {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.}
}