| The Minimum FIll—in for the Corona of Two Graphs |
| |
| 引用本文： | 靳志勇.The Minimum FIll—in for the Corona of Two Graphs[J].数学季刊,1996,11(1):107-110. |
| |
| 作者姓名： | 靳志勇 |
| |
| 作者单位： | Henan University. Kaifeng，China，475001 |
| |
| 摘 要： | Ｔｈｅ Ｍｉｎｉｍｕｍ Ｆｉｌｌ－ｉｎ ｆｏｒ ｔｈｅ Ｃｏｒｏｎａ ｏｆ Ｔｗｏ ＧｒａｐｈｓＴｈｅＭｉｎｉｍｕｍＦｉｌｌ－ｉｎｆｏｒｔｈｅＣｏｒｏｎａｏｆＴｗｏＧｒａｐｈｓ￥ＪｉｎＺｈｉｙｏｎｇ；ＬｉＷｅｎｑｕａｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ...
|
| 关 键 词： | 简单图 最小填充数 标号 加冠 |
The Minimum Fill-in for the Corona of Two Graphs |
| |
| Jin Zhiyong, Li Wenquan.The Minimum Fill-in for the Corona of Two Graphs[J].Chinese Quarterly Journal of Mathematics,1996,11(1):107-110. |
| |
| Authors: | Jin Zhiyong Li Wenquan |
| |
| Abstract: | In this paper, we determine the minimum fill-ins of the corona G. H of two graphs G and H when the minimum fill-in of G,H were known as F(G),F(H). Our result is that |
| |
| Keywords: | graph labelling minimum fill-in |
| 本文献已被 CNKI 维普 等数据库收录！ |
