| 网图F（m；n_1，n_2，…，n_m）的K－优美性 |
| |
| 引用本文： | 卜长江,高振滨,齐玉梅.网图F（m；n_1，n_2，…，n_m）的K－优美性[J].哈尔滨工程大学学报,1995(1). |
| |
| 作者姓名： | 卜长江 高振滨 齐玉梅 |
| |
| 摘 要： | 定义了一种图称之为网图Ｆ（ｍ；ｎ１，ｎ２，…，ｎｍ），证明了当ｎ１＞ｎ２＞…＞ｎｍ时．Ｆ（ｍ；ｎ１，ｎ２，…，ｎｍ）。为Ｋ－优美，Ｋ为任意非负整数，同时给出了几个推论。
|
| 关 键 词： | 网图 K－优美图 K－优美标号 |
The K-Gracefulness of Mesh Graph |
| |
| Bu Changjiang,Gao Zhenbin,Qi Yumei.The K-Gracefulness of Mesh Graph[J].Journal of Harbin Engineering University,1995(1). |
| |
| Authors: | Bu Changjiang Gao Zhenbin Qi Yumei |
| |
| Affiliation: | Dept. of Mathematics and Mechanics |
| |
| Abstract: | n this paper we define a kind of graph which is called mesh Graph, and it isdenoted F(m;n1,n2,...,nm). When n1>n2>... > nm, we prove that F(m;n1,n2,...,nm) isK-graceful. |
| |
| Keywords: | mesh graph K-gracefulness K-graceful labelling |
| 本文献已被 CNKI 等数据库收录！ |
