| 几类特殊的M2-等可覆盖图 |
| |
| 引用本文： | 张玉琴,兰文华.几类特殊的M2-等可覆盖图[J].天津大学学报(自然科学与工程技术版),2009,42(1):83-85. |
| |
| 作者姓名： | 张玉琴 兰文华 |
| |
| 作者单位： | 张玉琴,ZHANG Yu-qin(天津大学理学院,天津,300072);兰文华,LAN Wen-hua(河北师范大学数学与信息科学学院,石家庄,050016)
|
| |
| 摘 要： | 若图G的每个极小H-覆盖都是它的最小H-覆盖，则称图G为H-等可覆盖的．得出了M2-等可覆盖图的必要条件，并刻画了以下几类特殊M2-等可覆盖图的特征：匹配、路、圈、完全图、完全二部图、轮图和扇图．
|
| 关 键 词： | H-覆盖 H-可分解图 H-等可覆盖图 |
Some Special Mz-Equicoverable Graphs |
| |
| ZHANG Yu-qin,LAN Wen-hua.Some Special Mz-Equicoverable Graphs[J].Journal of Tianjin University(Science and Technology),2009,42(1):83-85. |
| |
| Authors: | ZHANG Yu-qin LAN Wen-hua |
| |
| Institution: | ZHANG Yu-qin, LAN Wen-hua ( 1. School of Sciences, Tianjin University, Tianjin 300072, China; 2. School of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050016, China) |
| |
| Abstract: | A graph G is H-equicoverable if every minimal H-covering in G is also its minimum H-covering. In this paper, necessary conditions for M2-equicoverable graphs are provided and several special M2-equicoverable graphs are characterized. They are matching, path, cycle, complete graph, complete bipartite graph, wheel and fan. |
| |
| Keywords: | H-covering H-decomposable graph H-equicoverable graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
