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 dF(v)=2k, k∈N+ for every vertex v∈ V(G). This note establishes a sufficient condition to ensure that a connected graph G of even order with the minimum degree δ contains an even factor based on the signless Laplacian spectral radius.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.