The following pages link to (Q5867383):
Displaying 7 items.
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs (Q2109106) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond (Q6614178) (← links)
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs (Q6615460) (← links)
- Binding number, odd \([1, b]\)-factors and the distance spectral radius (Q6648281) (← links)
- Toughness and distance spectral radius in graphs involving minimum degree (Q6657220) (← links)