scientific article; zbMATH DE number 5044754
From MaRDI portal
Publication:5481401
zbMath1110.05058MaRDI QIDQ5481401
Publication date: 9 August 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (19)
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] ⋮ Large matchings from eigenvalues ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ Regular factors and eigenvalues of regular graphs ⋮ 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 ⋮ Graph toughness from Laplacian eigenvalues ⋮ An inequality using perfect matchings and Laplacian spread of a graph ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ The \(A_\alpha\)-spectral radius and perfect matchings of graphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Matchings in regular graphs from eigenvalues ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Fractional matching number and eigenvalues of a graph ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ Signless Laplacian spectral radius and fractional matchings in graphs ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number
This page was built for publication:
