The following pages link to Eigenvalues and perfect matchings (Q1765910):
Displaying 50 items.
- A Cheeger inequality of a distance regular graph using Green's function (Q393465) (← links)
- A characterization of graphs by codes from their incidence matrices (Q396825) (← links)
- Regular factors and eigenvalues of regular graphs (Q404439) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- Cospectral regular graphs with and without a perfect matching (Q482228) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Spectral conditions for some graphical properties (Q526290) (← links)
- Signless Laplacian spectral radius and fractional matchings in graphs (Q785815) (← links)
- The chromatic number and rank of the complements of the Kasami graphs (Q861803) (← links)
- Large matchings from eigenvalues (Q869943) (← links)
- Eigenvalues and \([1,n]\)-odd factors (Q979009) (← links)
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- The vertex-connectivity of a distance-regular graph (Q1011508) (← links)
- On the Laplacian spectral radii of trees with perfect matchings (Q1028015) (← links)
- Eigenvalues and edge-connectivity of regular graphs (Q1044623) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- Codes from incidence matrices of graphs (Q1951220) (← 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)
- The cyclic edge-connectivity of strongly regular graphs (Q2000569) (← links)
- The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197) (← 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 Laplacian spread of line graphs (Q2092368) (← links)
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs (Q2109106) (← links)
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices (Q2133676) (← links)
- Minimum arc-cuts of normally regular digraphs and Deza digraphs (Q2138973) (← links)
- Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
- Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues (Q2185908) (← links)
- The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching (Q2226453) (← links)
- Spectral radius and matchings in graphs (Q2229492) (← 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)
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← links)
- Matching extendability and connectivity of regular graphs from eigenvalues (Q2303429) (← links)
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree (Q2312657) (← links)
- Minimum cuts of distance-regular digraphs (Q2409834) (← links)
- Two sufficient conditions for odd \([1,b]\)-factors in graphs (Q2682854) (← links)
- Eigenvalues and parity factors in graphs with given minimum degree (Q2685325) (← links)
- Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs (Q2699581) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Regular graphs, eigenvalues and regular factors (Q2891046) (← links)
- Algebraic conditions for t-tough graphs (Q3073536) (← links)
- The chromatic index of strongly regular graphs (Q3390046) (← links)
- Expander graphs and gaps between primes (Q3529867) (← links)
- An inequality using perfect matchings and Laplacian spread of a graph (Q4622859) (← links)
- Spectral conditions for graphs to be β-deficient involving minimum degree (Q4640095) (← links)
