Uniformly Weighted Star-Factors of Graphs
Abstract
A star-factor of a graph G is a spanning subgraph of G such that each component of which is a star. An edge-weighting of G is a function w: E(G) N+, where N+ is the set of positive integers. Let be the family of all graphs G such that every star-factor of G has the same weights under a fixed edge-weighting w. In this paper, we present a simple structural characterization of the graphs in that have girth at least five.
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.