首页 | 官方网站   微博 | 高级检索  
     

P2n的边幻和标号算法及超边幻和标号算法
引用本文:刘家保,何芳.P2n的边幻和标号算法及超边幻和标号算法[J].渝州大学学报(自然科学版),2014(2):12-15.
作者姓名:刘家保  何芳
作者单位:[1]安徽新华学院公共课程部,合肥230088 [2]安徽大学数学科学学院,合肥230601
基金项目:安徽省高等学校省级自然科学基金项目(KJ2013B015);安徽新华学院质量工程建设资助项目(2012tskcx04)
摘    要:设L为简单无向图G从V(G) ∪E(G)→{1,2,…,|V(G) ∪E(G)|}的一个双射函数,若L满足以下条件:对L所有的边xy∈E(G),x、y∈ V(G),都有L(x)+L(y)+L(xy)=C,C为常数,则L是图G的边幻和标号,图G是边幻和图;若在此基础上,图G的顶点标号满足:L(V(G))={1,2,…,|X(G)|},则L为图G的超边幻和标号,图G是超边幻和图;主要研究一类图P2n的边幻和标号以及超边幻和标号,并给出了相应的证明.

关 键 词:超边幻和标号  超边幻和图  图P2n

The Algorithm of Edge-magic Total Labeling and Super Edge-magic Total Labeling of P2n
LIU Jia-bao,HE Fang.The Algorithm of Edge-magic Total Labeling and Super Edge-magic Total Labeling of P2n[J].Journal of Yuzhou University(Natural Sciences Edition),2014(2):12-15.
Authors:LIU Jia-bao  HE Fang
Affiliation:1.Fundamental Courses Department, Anhui Xinhua University, Hefei 230088, China; 2.School of Mathematical Seienees,Anhui University,Hefei 230601, China )
Abstract:Let L be a bijective function of simple undirected graph G from V(G) UE( G)→{ 1,2, ..., |V(G) UE(G) | } ;L was said to be a edge-magic total labeling of G and G is a edge-magic total graph if L satisfied the following :for all xy ∈E(G) ,x ,y∈ V(G) there are the resuhs that L(x) +L(y) +L(xy) = C, C is a constant , on the basis of it,if the vertex labeling of G satisfied L( V(G) ) = { 1,2, …, | V(G) |}, then L was said to be a super edge- magic total labeling of graph G, G is a super edge-magic total graph. This paper researched the edge-magic total labeling and super edge-magic total labeling of Pn2, and gave the corresponding proofs.
Keywords:super edge-magic total labeling  super edge-magic total graphs  graph P2n
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号