Spectral conditions for graphs in which every edge belongs to a factor
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.