arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.0226math.CO
收藏

星一致图

Star-uniform Graphs

Mikio Kano, Yunjian Wu, Qinglin Yu

摘要:

图$G$的{ \it星因子}是$G$的生成子图,使得它的每个分量都是星。显然,每个没有孤立点的图都有一个星因子。一个图$G$称为{ \it star-uniform},如果$G$的所有星因子具有相同的分支数。星一致图的刻画是Hartnell和Rall在最小生成树和最优分配问题的启发下提出的一个公开问题。利用因子临界性和控制数的概念刻画了所有最小度至少为2的星一致图。我们的证明在很大程度上依赖于Gallai-Edmonds匹配结构定理。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑