| 点可迁图中的两个不相交的极大独立点集 |
| |
| 引用本文： | 王朝瑞,石民勇. 点可迁图中的两个不相交的极大独立点集[J]. 北京理工大学学报, 1991, 0(3) |
| |
| 作者姓名： | 王朝瑞 石民勇 |
| |
| 作者单位： | 北京理工大学应用数学系(王朝瑞)，北京理工大学应用数学系(石民勇) |
| |
| 摘 要： | C.Berp,E.J.Ockayne和S.T.Hedetniemi猜想每个非空点可迁图包含两个不相交的极大独立点集.本文证明了下面的结果: 1.设L在V(G)上可迁且为交换群,则G有两个不相交的极大独立点集。 2.设L在V(G)上可迁且为幂零群,则G有两个不相交的极大独立点集。 3.p~k阶(p为素数)非空点可迁图包含两个不相交的极大独立点集。
|
| 关 键 词： | 交换群 幂零群/可迁 独立集 |
Two Disjoint Maximal Independent Sets in Vertex -Transitive Graphs |
| |
| Wang Chaorui Shi Minyong. Two Disjoint Maximal Independent Sets in Vertex -Transitive Graphs[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 1991, 0(3) |
| |
| Authors: | Wang Chaorui Shi Minyong |
| |
| Affiliation: | Department of Applied Mathematics |
| |
| Abstract: | C . Berge , E. J . Cockayne and S . T . Hedetniemi conjectured that every nonempty vertex-transitive graph contains two maximal independent vertex sets .The following results are proved : (1) Let L be transitive on V(G) and Abelian , then G has two disjoint maximal independent sets , and each contains a. vertices , (where a is the independence number of G) . (2) Let L be transitive on V (G) and nilpotent , then G has two disjoint maximal independent sets . (3) A nonempty vertex-transitive graph of order pk ,p a prime , contains two disjoint maximal independent sets . |
| |
| Keywords: | commutative group nil potent groups / transitive independent set |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
|
