Spectral conditions for graphs in which every edge belongs to a factor

2024/01/15 by Cai, Jin, Zhou, Bo
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2401.12984

Abstract

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.

Related

• Spectral Sufficient Conditions for Graph Factors
• Spectral conditions for graphs to contain k-factors
• Signless Laplacian spectral conditions for even factors in graphs
• Spectral radius and [a,b]-factors in graphs
• A note on the spectral radius and [a,b]-factor of graphs