English

Uniformly Weighted Star-Factors of Graphs

Combinatorics 2007-07-03 v1

Abstract

A {\it star-factor} of a graph GG is a spanning subgraph of GG such that each component of which is a star. An {\it edge-weighting} of GG is a function w:E(G)N+w: E(G)\longrightarrow \mathbb{N}^+, where N+\mathbb{N}^+ is the set of positive integers. Let Ω\Omega be the family of all graphs GG such that every star-factor of GG has the same weights under a fixed edge-weighting ww. In this paper, we present a simple structural characterization of the graphs in Ω\Omega that have girth at least five.

Keywords

Cite

@article{arxiv.0707.0227,
  title  = {Uniformly Weighted Star-Factors of Graphs},
  author = {Yunjian Wu and Qinglin Yu},
  journal= {arXiv preprint arXiv:0707.0227},
  year   = {2007}
}