Pages that link to "Item:Q2229492"

The following pages link to Spectral radius and matchings in graphs (Q2229492):

Displaying 43 items.

• Spectral radii of tournament matrices whose graphs are related by an arc reversal (Q1805320) (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) (← links)
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number (Q2075523) (← links)
• Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
• On the \(A_\alpha\)-spectral radius of graphs without large matchings (Q2091147) (← links)
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree (Q2093104) (← links)
• Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs (Q2109106) (← links)
• Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
• Perfect matching and distance spectral radius in graphs and bipartite graphs (Q2231774) (← links)
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs (Q2238866) (← links)
• Two sufficient conditions for odd \([1,b]\)-factors in graphs (Q2682854) (← links)
• On the spectral radius of cactuses with perfect matchings (Q2853196) (← links)
• (Q5867383) (← links)
• An extremal problem on <i>Q</i>-spectral radii of graphs with given size and matching number (Q5870093) (← links)
• The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
• The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number (Q6041869) (← links)
• Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
• ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS (Q6082047) (← links)
• Spectral radius and rainbow matchings of graphs (Q6084873) (← links)
• The matchings and spectral radius of graphs involving minimum degree (Q6102093) (← links)
• Matchings in graphs from the spectral radius (Q6116931) (← links)
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
• Matching extension and distance spectral radius (Q6173921) (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
• Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)
• The \(A_\alpha\)-spectral radius for path-factors in graphs (Q6204351) (← links)
• On the matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)
• Distance signless Laplacian spectral radius for the existence of path-factors in graphs (Q6562884) (← links)
• Fractional matchings in graphs from the spectral radius (Q6564841) (← links)
• Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs (Q6611082) (← links)
• Path factors in bipartite graphs from size or spectral radius (Q6614061) (← links)
• Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs (Q6615460) (← links)
• The average connectivity matrix of a graph (Q6646412) (← 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)
• Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs (Q6657244) (← links)
• Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)
• A spectral condition for component factors in graphs (Q6658438) (← links)
• Spectral sufficient conditions for graph factors containing any edge (Q6658863) (← links)
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius (Q6667372) (← links)