Signless Laplacian spectral conditions for even factors in graphs

Abstract

A spanning subgraph $F$ of a graph $G$ is defined as an even factor of $G$, if the degree $d_F(v)=2k,k\in {\mathbb{N}}^{+}$ for every vertex $v\in V(G)$. This note establishes a sufficient condition to ensure that a connected graph $G$ of even order with the minimum degree $\hat{I}´$ contains an even factor based on the signless Laplacian spectral radius.

9 pages