Spectral radius and size conditions for fractional (a,b,m)-covered graphs
Abstract
A fractional (a,b,m)-covered graph is a generalization of the concept of a fractional [a,b]-covered graph. For any H ⊂eq G with edge set |E(H)| = m, if there exists a fractional [a,b]-factor (the corresponding fractional indicator function is h) such that h(e) = 1 for any e ∈ H, then the graph G is called a fractional (a,b,m)-covered graph. In this paper, we characterize the conditions for a graph to be a fractional (a,b,m)-covered graph from the perspectives of spectral radius and size, respectively.
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.