Fractional matching number and eigenvalues of a graph
From MaRDI portal
Publication:5240735
DOI10.1080/03081087.2018.1498059zbMath1425.05096OpenAlexW2883188133WikidataQ129493258 ScholiaQ129493258MaRDI QIDQ5240735
Jie Xue, Ming-qing Zhai, Jin-Long Shu
Publication date: 29 October 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1498059
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Spectral radius and \([a,b\)-factors in graphs] ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ The \(A_\alpha\)-spectral radius and perfect matchings of graphs ⋮ Domination number and Laplacian eigenvalue of trees ⋮ Signless Laplacian spectral radius and fractional matchings in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral radius and fractional matchings in graphs
- Spectral radius and Hamiltonian graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Large matchings from eigenvalues
- The difference and ratio of the fractional matching number and the matching number of graphs
- Matchings in regular graphs from eigenvalues
- Eigenvalues and perfect matchings
- Interlacing eigenvalues and graphs
- Sharp lower bounds on the fractional matching number
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Eigenvalues of the Laplacian of a graph∗
- The spectral radius of edge chromatic critical graphs
This page was built for publication: Fractional matching number and eigenvalues of a graph
