Regular Graphs, Eigenvalues and Regular Factors
From MaRDI portal
Publication:2891046
DOI10.1002/jgt.20581zbMath1243.05153MaRDI QIDQ2891046
Publication date: 13 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20581
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Spectral conditions for graphs to be β-deficient involving minimum degree, Unnamed Item, Eigenvalues and triangles in graphs, Sharp conditions for the existence of an even $[a,b$-factor in a graph], A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, Eigenvalues and [a,b‐factors in regular graphs], Regular factors and eigenvalues of 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, A tight lower bound on the matching number of graphs via Laplacian eigenvalues, Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs, On the \(A_\alpha\)-spectral radius of graphs without large matchings, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles, Spectral radius and \([a,b\)-factors in graphs], Cospectral bipartite graphs with the same degree sequences but with different number of large cycles, Eigenvalues and parity factors in graphs with given minimum degree, Sharp spectral bounds for the vertex-connectivity of regular graphs, Graph toughness from Laplacian eigenvalues, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
Cites Work
