Uniform Star-factors of Graphs with Girth Three

Details Uniform Star-factors of Graphs with Girth Three Uniform Star-factors of Graphs with Girth Three

2007-07-02

arxiv.org/abs/0707.0224v1

Mathematics

Combinatorics

Scientific paper

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 $\mathscr{U}$ of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family $\mathscr{U}$ 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.

Affiliated with

Also associated with

No associations

Rating

Uniform Star-factors of Graphs with Girth Three does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniform Star-factors of Graphs with Girth Three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform Star-factors of Graphs with Girth Three will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692756