Uniformly Weighted Star-Factors of Graphs
Combinatorics
2007-07-03 v1
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.
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}
}