Motivated　by　recent　progresses　on　study　of　factors　and　spectral　extremal　graph　theory,　in　this　paper,　we　focus　on　distance　spectral　extrema　of　k-factors　in　bipartite　graphs　for　small　k.　First　of　all,　we　aim　to　investigate　the　existence　of　1-factor　in　a　bipartite　graph　with　given　minimum　degree　in　terms　of　its　distance　spectral　radius,　which　generalize　and　improve　the　previous　result　in　[37].　Then　we　determine　the　extremal　graph　attaining　the　minimum　distance　spectral　radius　among　all　bipartite　graphs　with　a　unique　perfect　matching.　Notice　that　a　2-factor　consists　of　some　vertex-disjoint　cycles.　As　a　beginning,　we　naturally　consider　some　propositions　of　vertex-disjoint　cycles　and　give　a　sufficient　condition　for　the　existence　of　two　vertex-disjoint　cycles　in　a　bipartite　graph　with　respect　to　the　distance　spectral　radius.　©　2022　Elsevier　Inc.