Pages that link to "Item:Q3013140"

The following pages link to Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs (Q3013140):

Displaying 31 items.

• Spectral radius and fractional matchings in graphs (Q268270) (← links)
• Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
• Matchings in graphs of odd regularity and girth (Q394288) (← links)
• Regular factors and eigenvalues of regular graphs (Q404439) (← links)
• Spectral conditions for some graphical properties (Q526290) (← links)
• Matching and edge-connectivity in regular graphs (Q616391) (← links)
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs (Q905705) (← links)
• Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← 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)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← 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)
• 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)
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
• A generalization of Petersen's matching theorem (Q2111920) (← links)
• The second largest eigenvalue and vertex-connectivity of regular multigraphs (Q2181221) (← links)
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues (Q2185908) (← links)
• Spectral radius and matchings in graphs (Q2229492) (← links)
• Sharp spectral bounds for the vertex-connectivity of regular graphs (Q2687918) (← links)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Spectral conditions for graphs to be β-deficient involving minimum degree (Q4640095) (← links)
• Fractional matching number and eigenvalues of a graph (Q5240735) (← links)
• An extremal problem on <i>Q</i>-spectral radii of graphs with given size and matching number (Q5870093) (← links)
• Fractional matching number and spectral radius of nonnegative matrices of graphs (Q5887668) (← links)
• The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number (Q6041869) (← links)
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)
• Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
• The matchings and spectral radius of graphs involving minimum degree (Q6102093) (← links)
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)