2007/07/02 by Yunjian Wu, Wu, Yunjian, Qinglin Yu +1
Mathematics · #05C69 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C69 #msc:05C70
paper · pdf · doi:10.48550/arxiv.0707.0224
arxiv created 2007/07/02 · arxiv updated 2009/12/01
A \it star-factor of a graph G is a spanning subgraph of G such that each component of which is a star. Recently, Hartnell and Rall studied a family \mathscrU of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family \mathscrU when the girth is at least five. In this paper, we investigate the family of graphs with girth three and determine all members of this family.