Abstract
For , a -factor of a graph G is a spanning subgraph F of G such that each component of F is a path with at least k vertices. A graph G is a -factor covered graph if for each edge e in , there exists a -factor containing the edge e. Let and be the signless Laplacian matrix and the distance matrix of a graph G, respectively. In this paper, we provide lower bounds for the spectral radius of in an n-vertex connected graph to guarantee that G has a -factor or is a -factor covered graph. Furthermore, we establish upper bounds for the spectral radius of in an n-vertex connected graph to guarantee that G has a -factor or is a -factor covered graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
