Star-uniform Graphs

Details Star-uniform Graphs Star-uniform Graphs

2007-07-02

arxiv.org/abs/0707.0226v1

Mathematics

Combinatorics

Scientific paper

A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph $G$ is called {\it star-uniform} if all star-factors of $G$ have the same number of components. To characterize star-uniform graphs was an open problem posed by Hartnell and Rall, which is motivated by the minimum cost spanning tree and the optimal assignment problems. We use the concepts of factor-criticality and domination number to characterize all star-uniform graphs with the minimum degree at least two. Our proof is heavily relied on Gallai-Edmonds Matching Structure Theorem.

Affiliated with

Also associated with

No associations

Rating

Star-uniform Graphs 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 Star-uniform Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Star-uniform Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692761