Pages that link to "Item:Q2066004"

The following pages link to A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004):

Displaying 14 items.

• A new lower bound for the number of perfect matchings of line graph (Q477656) (← links)
• Matchings in regular graphs from eigenvalues (Q1003830) (← links)
• Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
• Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732) (← links)
• A relation between the matching number and Laplacian spectrum of a graph (Q5932188) (← links)
• Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
• Degree conditions for the existence of a {<i>P</i>₂, <i>P</i>₅}-factor in a graph (Q6140939) (← links)
• Matching extension and distance spectral radius (Q6173921) (← 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)
• A unified combinatorial view beyond some spectral properties (Q6635841) (← links)
• An improved spectral lower bound of treewidth (Q6663525) (← links)