Uniformly Weighted Star-Factors of Graphs
classification
🧮 math.CO
keywords
graphsedge-weightingmathbbomegastar-factorcharacterizationcomponentevery
read the original abstract
A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each component of which is a star. An {\it edge-weighting} of $G$ is a function $w: E(G)\longrightarrow \mathbb{N}^+$, where $\mathbb{N}^+$ is the set of positive integers. Let $\Omega$ 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 $\Omega$ that have girth at least five.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.