Eigenvalues and perfect matchings
From MaRDI portal
Publication:1765910
DOI10.1016/J.LAA.2004.08.014zbMATH Open1056.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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (76)
- A Cheeger inequality of a distance regular graph using Green's function
- A characterization of graphs by codes from their incidence matrices
- Eigenvalues and triangles in graphs
- The cyclic edge-connectivity of strongly regular graphs
- Regular factors and eigenvalues of regular graphs
- The extendability of matchings in strongly regular graphs
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
- Graph toughness from Laplacian eigenvalues
- The vertex-connectivity of a distance-regular graph
- Codes from incidence matrices of graphs
- Eigenvalues and \([1,n]\)-odd factors
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- Large matchings from eigenvalues
- Cospectral regular graphs with and without a perfect matching
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- Spectral radius and fractional perfect matchings in graphs
- Matchings in regular graphs from eigenvalues
- The chromatic number and rank of the complements of the Kasami graphs
- Eigenvalues and [a,b]‐factors in regular graphs
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- Eigenvalues and edge-connectivity of regular graphs
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Minimum cuts of distance-regular digraphs
- Expander graphs and gaps between primes
- A Proof of Brouwer's Toughness Conjecture
- The \(p\)-restricted edge-connectivity of Kneser graphs
- DISTANCE LAPLACIAN SPECTRUM OF THE COMMUTING GRAPH OF FINITE CA-GROUPS
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Fractional matching number and eigenvalues of a graph
- Algebraic conditions for t-tough graphs
- Matching extension and distance spectral radius
- Regular graphs, eigenvalues and regular factors
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Matching extendability and connectivity of regular graphs from eigenvalues
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spectral conditions for graphs to be β-deficient involving minimum degree
- The chromatic index of strongly regular graphs
- Signless Laplacian spectral radius and fractional matchings in graphs
- Eigenvalues and parity factors in graphs with given minimum degree
- Spectral radius and matchings in graphs
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number
- Distance spectrum, 1-factor and vertex-disjoint cycles
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- The Laplacian spread of line graphs
- Bicliques and eigenvalues
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- Max-cut and extendability of matchings in distance-regular graphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- Matchings in graphs from the spectral radius
- On the Laplacian spectral radii of trees with perfect matchings
- On the \(A_\alpha\)-spectral radius of graphs without large matchings
- Spectral radius and \([a,b]\)-factors in graphs
- Toughness and normalized Laplacian eigenvalues of graphs
- Spectral conditions for some graphical properties
- Perfect matching in random graphs is as hard as Tseitin
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- Fractional matchings in graphs from the spectral radius
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- Thin trees in some families of distance-regular graphs
- An inequality using perfect matchings and Laplacian spread of a graph
- The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number
- 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
- Path factors in bipartite graphs from size or spectral radius
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
- Binding number, \(k\)-factor and spectral radius of graphs
- A unified combinatorial view beyond some spectral properties
- Matching extension and matching exclusion via the size or the spectral radius of graphs
- Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
This page was built for publication: Eigenvalues and perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765910)
