Regular Graphs, Eigenvalues and Regular Factors
From MaRDI portal
Publication:2891046
DOI10.1002/jgt.20581zbMath1243.05153OpenAlexW1553397336MaRDI 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
Related Items (21)
Spectral radius and \([a,b\)-factors 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 ⋮ Regular factors and eigenvalues of regular graphs ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Graph toughness from Laplacian eigenvalues ⋮ Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs ⋮ Eigenvalues and triangles in graphs ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Cites Work
This page was built for publication: Regular Graphs, Eigenvalues and Regular Factors
