| 伪对集复盖图 |
| |
| 引用本文： | 刘桂真.伪对集复盖图[J].山东大学学报(理学版),1992(4). |
| |
| 作者姓名： | 刘桂真 |
| |
| 作者单位： | 山东大学数学研究所 |
| |
| 摘 要： | 若过图G的每条边都有一个亏数为d的伪对集,则称图G为亏数d-复盖图。本文给出了一个图是亏数d-复盖图的充分必要条件及该条件的一些应用,从而推广了Little 的结果.
|
| 关 键 词： | 图 伪对集 复盖 |
PSEUDO MATCHING COVERED GRAPHS |
| |
| Liu Guizhen.PSEUDO MATCHING COVERED GRAPHS[J].Journal of Shandong University,1992(4). |
| |
| Authors: | Liu Guizhen |
| |
| Abstract: | If for every edge e of a graph G there is a defect-d pseudo matching containing e,thenG is called a defect-d covered graph.A necessary and sufficient condition for a graph to be adefect-d covered graph and its some applications are given.Therefore some results of Littleare extended. |
| |
| Keywords: | graph pseudo matching covered |
| 本文献已被 CNKI 等数据库收录！ |
