检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘信生[1] 王蓓蓓[1] 陈璟[1] 姚兵[1] LIU Xinsheng WANG Beibei CHEN Jing YAO Bing(College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Chin)
机构地区:[1]西北师范大学数学与统计学院,甘肃兰州730070
出 处:《西北大学学报(自然科学版)》2016年第5期629-633,644,共6页Journal of Northwest University(Natural Science Edition)
基 金:国家自然科学基金资助项目(61163037;61163054;61363060)
摘 要:为了探讨斐波纳契毛毛虫树的边标号,采用不同于原定义的图标号的方法 -先从边对每个图进行标号。利用先从边标号的特点,主要讨论了1-斐波纳契毛毛虫树的边二分奇优美标号,边优美标号及边魔幻全标号。最后讨论了1-斐波纳契毛毛虫超级同构图的二分奇优美标号。这样的方法省去了大量繁复工作,大大提高了图标号的效率。The study is to explore the edge labelling of the Fibonacci's caterpillar tree. The method is employed which is different from the original concept of graph labelling-starting from the edge labelling for each graph. And taking advantage of the characteristics of edge labelling, the paper mainly discusses the bipartite odd-graceful labelling, edge-graceful labelling and edge-magic total labelling of 1-Fibonacci's caterpillar tree. Lastly, the paper deliberates the bipartite odd-graceful labelling of the 1-Fibonacci's caterpillar super isomorphic graph. This process saves a lot of complex work, which greatly improves the efficiency of graph labelling.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.120.131