| On the Gracefulness of Two Family of the Hexagonal Graphs |
| |
| 作者姓名： | 杨燕昌 王广选 |
| |
| 作者单位： | Yang Yanchang(Dept. of Applied Math.，Beijing Polytechnic University，100022)Wang Guangxuan (The Computer Room of Miyun Hospital，Beijing，101500) |
| |
| 摘 要： | Thegracefulgraphswaspresentedinl966.Sincethattime,manyresultshavebeenobtainedongacefulgraphsandit'smanyapplicationsappear(see2j,L4j).Thegraceful-nessofP.XP.andC.XP,areprovedbythepaper1],3j,5j,6]-Followingthis,inthispaper,itisobtainedthatthegracefu1nessofthefamiliesofthehexagonalgraphsG,(n)andG2(n).Fornotationsandteminologiesonthegracelulgraphnotdefinedhere,wefollowthereference3j-NowletG(V,E)beagraph,6bethelabelingoftheverticesofG,andforanyedgeuv,define6(uv)=lo(u)-o(v)Iitistheedge's…
|
| 关 键 词： | 六边形图 优美性 桔号 图论 |
On the Gracefulness of Two Family of the Hexagonal Graphs |
| |
| Yang Yanchang.On the Gracefulness of Two Family of the Hexagonal Graphs[J].Chinese Quarterly Journal of Mathematics,1997,12(1):4-12. |
| |
| Authors: | Yang Yanchang |
| |
| Institution: | [1]Dept.of [2]Applied |
| |
| Abstract: | In the paper,we construct two families of the hexagonal graphs G1 (n) and G2 (n),and prove their gracefulness. |
| |
| Keywords: | hexagonal graph labeling gracefulness |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
