Spectral sufficient conditions for graph factors containing any edge
From MaRDI portal
Recommendations
- Spectral radius and \([a,b]\)-factors in graphs
- Fractional matching, factors and spectral radius in graphs involving minimum degree
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
- Spectral conditions for graphs having all (fractional) $[a,b]$-factors
Cites work
- A theorem on connected graphs in which every edge belongs to a 1-factor
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- scientific article; zbMATH DE number 4191727 (Why is no real title available?)
- scientific article; zbMATH DE number 3869380 (Why is no real title available?)
- Matchings in graphs from the spectral radius
- On 2-factors with given properties in claw-free graphs
- On defect-d matchings in graphs
- On the \(A_{\alpha}\)-spectra of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Some existence theorems on path factors with given properties in graphs
- Spectra of graphs
- Spectral conditions for some graphical properties
- Spectral radius and matchings in graphs
- Star-factors in graphs with large minimum degree
- The A_-spectral radius for path-factors in graphs
- The spectral radius of trees on \(k\) pendant vertices
This page was built for publication: Spectral sufficient conditions for graph factors containing any edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658863)
