关于四角仙人掌图的海明优美性  

On Hamming Gracefulness of Quadrilateral Cactus Graph

作　　者：李秀芬[1] 潘伟[2] 

机构地区：[1]吉林工程技术师范学院教育技术中心,长春130052 [2]海南大学理工学院,海口570228

出　　处：《吉林大学学报（信息科学版）》2008年第6期605-608,共4页Journal of Jilin University（Information Science Edition）

基　　金："十一五"吉林省教育厅科学技术基金资助项目(2007227)

摘　　要：为了研究图的海明优美性问题,通过构造标号函数方法,论证了海明优美图的任意一个顶点悬挂一个回路C4所得的图(记作G+C4)也是海明优美图。由此推出结论:所有树型四角仙人掌图都是海明优美图,其中,图C4是4个顶点的回路。Hamming gracefulness of graphs problem, in computer network＇s graceful embedding aspect, has the good application value and the broad research prospect. So far, few related works has been done in domestic and abroad. Therefore, we introduce and establish the labeling function method to prove that the graphs G ＋ C4 were hamming-graceful, which hamming-graceful graph G random vertex hangs a circuit C4 obtained graphs. An important conclusion was proved from this all connection＇s quadrilateral cactus graph are hamming-graceful graphs in which graph C4 is an 4-vertex circuit.

关 键 词：优美图 四角仙人掌图 海明优美图 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]