期刊文献+

非边幻和图的若干定理及证明 被引量:1

Some Theorems and Proofs of Non-Edge-Magic Total Labeling Graphs
原文传递
导出
摘要 若G(p,q)的点边标号一一映射到{1,2,…,p+q},使得任意边与其关联顶点的标号值之和为一个常数,这种标号被称之为边幻和全标号。本文设计了一种算法得到了9个点以内所有简单无向连通图中的非边幻和图,发现其中一些图具有某种相同的特征,因此定义了新的图运算符Kn▷Cm和KnΔSm来刻画这两类联图,通过引入西顿序列,证明了在特定条件下,两类联图为非边幻和图。 If the labeling values of edges and vertices for a graph G(p,q)are mapped one by one to{1,2,…,p+q},the sum of the labeling values for the edge and its incident vertices equals to a constant,and this labeling is called edge-magic total labeling.In this paper,an algorithm is designed to find all non-edge-magic total labeling graphs of all simple undirected connected graphs within 9 vertices.And we also find that some of the graphs have the same characteristics,thus define the new graph's operational characters Kn▷Cm and KnΔSm to depict them.Finally,by introducing the Sidon sequence,it is proved that two types of composite graphs are non-edge-magic total labeling graphs under certain conditions.
作者 顾彦波 李敬文 邵淑宏 王笔美 GU Yanbo;LI Jingwen;SHAO Shuhong;WANG Bimei(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,Gansu,China)
出处 《武汉大学学报(理学版)》 CAS CSCD 北大核心 2020年第3期237-243,共7页 Journal of Wuhan University:Natural Science Edition
基金 国家自然科学基金(11461038)。
关键词 边幻和全标号 非边幻和图 算法 联图 edge-magic total labeling non-edge-magic total labeling graphs algorithm composite graphs
  • 相关文献

同被引文献3

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部