| 关于完全图的G—覆盖数的一些结果 |
| |
| 引用本文： | 黄迎秋.关于完全图的G—覆盖数的一些结果[J].苏州大学学报(医学版),1999,15(3):17-21. |
| |
| 作者姓名： | 黄迎秋 |
| |
| 作者单位： | 港云港化工高等专科学校!连云港，222001 |
| |
| 摘 要： | 给定无孤立点的简单图Ｇ，完全图Ｋ的Ｇ－覆盖定义为一个序偶（Ｖ，Ｆ），其中Ｖ为Ｋ_ｖ的顶点集，Ｆ为Ｋ_v的一族子图，使得Ｆ中每一个子图都与Ｇ同构且Ｋ_v的每一条边至少出现在Ｆ的一个子图之中．完全图Ｋ_v的Ｇ－覆盖中所含的最少的子图个数称为它的Ｇ－覆盖数，记作（ν，Ｃ）．本文对五个顶点，五条边的４个图Ｇ，完全确定了Ｃ（ν，Ｇ）值．
|
| 关 键 词： | 完全图 G-覆盖 G-覆盖数 |
SOME RESULTS ON G-COVERING NUMBER OF THE COMPLETE GRAPH |
| |
| Huang Yingqiu.SOME RESULTS ON G-COVERING NUMBER OF THE COMPLETE GRAPH[J].Journal of Suzhou University(Natural Science),1999,15(3):17-21. |
| |
| Authors: | Huang Yingqiu |
| |
| Institution: | Lianyungang College of Chemical Technology Lianyungang 222001 |
| |
| Abstract: | Given a simple G without isolated venices, a G-covering of the complete graph Kv is defined as a pair (V, F) where V is the vertex set of Kv, F is a collection of subgraphs isomorphic to G in Kv, such that each edge of Kv appears in at least one of subgraph of F. In this paper, the C-cov- ering number of Kv, that is, the minimum number of subgraphs in a C-covering of Kv is determined completely for all integers and four graphs with five venices and five edges. |
| |
| Keywords: | G-covering G-covering number Complete graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
