2 papers
math.CO2026
Spectral radius for the existence of -factors in binding graphs
Sufang Wang, Wei Zhang
The binding number, denoted by $\mbox{bind}(G)$, of a graph is defined as the minimum value of taken over any non-empty subset of with $N_G(X)…
math.CO2026
Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
Sufang Wang, Wei Zhang
Let be a connected graph, and let and be two positive integers with (mod 2). A -odd factor of is a spanning subgraph of with $d_F(v)\equiv…