Regular graphs, eigenvalues and regular factors
From MaRDI portal
Recommendations
Cites work
Cited in
(36)- Regular graphs, regular factors, and the impact of Petersen's theorems
- 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_-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
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- 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.
- Regular factors and eigenvalues of regular graphs
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Eigenvalues and triangles in graphs
- Sharp Ore-type conditions for the existence of an even \([4,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
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
- Regular factors of regular graphs from eigenvalues
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- A spectral Erdős-Rademacher theorem
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- Path factors in bipartite graphs from size or spectral radius
- Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph
- Eigenvalues and spanning tree in regular graphs
- Spectral radius and rainbow k-factors of graphs
- The \(A_\alpha\)-spectral radius for \(\{P_2, C_3, P_5, \mathcal{T}(3)\}\)-factors in graphs
- Bipartite binding number, k-factor and spectral radius of bipartite graphs
- The size and \(A_\alpha\)-spectral radius for the existence of \(\{ K_{1, 1}, K_{1, 2}, \ldots, K_{1, k}, \mathcal{T} ( 2 k + 1 ) \}\)-factors in graphs
- A note on the spectral radius and \([a,b]\)-factor of graphs
- Eigenvalues and factors: a survey
- Tight spectral and size conditions for (fractional) (a, b; k)-critical graphs
This page was built for publication: Regular graphs, eigenvalues and regular factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891046)
