Uniformly Weighted Star-Factors of Graphs
Yunjian Wu, Qinglin Yu

TL;DR
This paper characterizes graphs with girth at least five where all star-factors have identical edge-weight sums, providing a structural understanding of such uniformly weighted star-factors.
Contribution
It offers a simple structural characterization of graphs with girth at least five where all star-factors share the same total edge weight.
Findings
Graphs in the family have a specific structure.
All star-factors in these graphs have equal total weights.
The characterization applies to graphs with girth at least five.
Abstract
A {\it star-factor} of a graph is a spanning subgraph of such that each component of which is a star. An {\it edge-weighting} of is a function , where is the set of positive integers. Let be the family of all graphs such that every star-factor of has the same weights under a fixed edge-weighting . In this paper, we present a simple structural characterization of the graphs in that have girth at least five.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
