Pages that link to "Item:Q5888899"

The following pages link to The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899):

Displaying 13 items.

• A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
• Toughness, Hamiltonicity and spectral radius in graphs (Q2701002) (← links)
• Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
• Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)
• Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs (Q6611082) (← links)
• Toughness and spectral radius in graphs (Q6611738) (← links)
• Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs (Q6615460) (← links)
• \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs (Q6639846) (← links)
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph (Q6648250) (← links)
• A spectral condition for a graph to have strong parity factors (Q6648260) (← links)
• Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs (Q6650589) (← links)