Spectral sufficient conditions for graph factors containing any edge

A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, 1-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.