| 引用本文： |
-
袁旭东,曹建香,袁春华.最小度至少是5的图的控制数[J].广西科学,2004,11(3):165-174. [点击复制]
- Yuan Xudong,Cao Jianxiang,Yuan Chunhua.Domination Number of Graphs with Minimum Degree at Least Five[J].Guangxi Sciences,2004,11(3):165-174. [点击复制]
|
|
| 摘要: |
| 设G是n个顶点的简单图.运用Reed引进的顶点不交的路覆盖,找出图G的一个控制集并估算这个控制集的基数,结合估算结果,证明如果图G的最小度至少是5,则图G有基数至多是5/14n的控制集. |
| 关键词: 图 控制数 最小度 路覆盖 |
| DOI： |
| 投稿时间：2003-12-26修订日期：2004-04-04 |
| 基金项目:广西青年科研基金(桂青科0135028)和国家自然科学基金(10171022)资助项目。 |
|
| Domination Number of Graphs with Minimum Degree at Least Five |
|
Yuan Xudong, Cao Jianxiang, Yuan Chunhua
|
| (Coll. of Math. & Comp. Sci., Guangxi Normal Univ., 3 Yucailu, Guilin, Guangxi, 541004, China) |
| Abstract: |
| Let G be a simple graph of n vertices.In this paper,by using the so-called vertex disjoint path cover introduced by Reed,we prove that the domination number is at most 5/14n for the graphs of minimum degree at least five. |
| Key words: graph domination number minimum degree path cover |
