Eigenvalues and perfect matchings
From MaRDI portal
Publication:1765910
DOI10.1016/j.laa.2004.08.014zbMath1056.05097OpenAlexW2154936094MaRDI QIDQ1765910
Willem H. Haemers, Andries E. Brouwer
Publication date: 23 February 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/9283486e-34f6-4a28-9315-a853b659d2ea
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Fractional matching number and spectral radius of nonnegative matrices of graphs, The spanning k-trees, perfect matchings and spectral radius of graphs, Regular Graphs, Eigenvalues and Regular Factors, Minimum arc-cuts of normally regular digraphs and Deza digraphs, Spectral radius and \([a,b\)-factors in graphs], Toughness and normalized Laplacian eigenvalues of graphs, The chromatic number and rank of the complements of the Kasami graphs, Large matchings from eigenvalues, Minimum cuts of distance-regular digraphs, A Cheeger inequality of a distance regular graph using Green's function, An odd \([ 1 , b \)-factor in regular graphs from eigenvalues], A characterization of graphs by codes from their incidence matrices, The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number, Spectral radius and fractional perfect matchings in graphs, Regular factors and eigenvalues of regular graphs, The extendability of matchings in strongly regular graphs, Eigenvalues and [a,b‐factors in regular graphs], ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS, Two sufficient conditions for odd \([1,b\)-factors in graphs], Matchings in graphs from the spectral radius, Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical, Eigenvalues and parity factors in graphs with given minimum degree, Matching extension and distance spectral radius, Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index, Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius, Binding number, \(k\)-factor and spectral radius of graphs, Matching extension and matching exclusion via the size or the spectral radius of graphs, Codes from incidence matrices of graphs, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs, Graph toughness from Laplacian eigenvalues, Expander graphs and gaps between primes, An inequality using perfect matchings and Laplacian spread of a graph, DISTANCE LAPLACIAN SPECTRUM OF THE COMMUTING GRAPH OF FINITE CA-GROUPS, Cospectral regular graphs with and without a perfect matching, Spectral radius and matchings in graphs, Perfect matching and distance spectral radius in graphs and bipartite graphs, Spectral conditions for graphs to be β-deficient involving minimum degree, Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius, The \(A_\alpha\)-spectral radius and perfect matchings of graphs, Max-cut and extendability of matchings in distance-regular graphs, Spectral conditions for some graphical properties, The cyclic edge-connectivity of strongly regular graphs, The \(p\)-restricted edge-connectivity of Kneser graphs, Eigenvalues and \([1,n\)-odd factors], The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph, Cospectral bipartite graphs with the same degree sequences but with different number of large cycles, Matchings in regular graphs from eigenvalues, Algebraic conditions for t-tough graphs, The vertex-connectivity of a distance-regular graph, Thin trees in some families of distance-regular graphs, Matching extendability and connectivity of regular graphs from eigenvalues, The chromatic index of strongly regular graphs, A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree, On the Laplacian spectral radii of trees with perfect matchings, A tight lower bound on the matching number of graphs via Laplacian eigenvalues, A Proof of Brouwer's Toughness Conjecture, The maximum spectral radius of \(t\)-connected graphs with bounded matching number, Eigenvalues and triangles in graphs, Fractional matching number and eigenvalues of a graph, Distance spectrum, 1-factor and vertex-disjoint cycles, Eigenvalues and edge-connectivity of regular graphs, Signless Laplacian spectral radius and fractional matchings in graphs, On the \(A_\alpha\)-spectral radius of graphs without large matchings, The Laplacian spread of line graphs, Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs, An extremal problem on Q-spectral radii of graphs with given size and matching number
Cites Work
