关于图(s〈c4,n〉)∪Pm的优美性
The gracefulness of graph ( s 〈 c4, n〉 ) ∪Pm
杜万根1
作者信息
- 1. 华东师范大学数学系,上海,200241
- 折叠
摘要
证明了满足一定条件的交错图G和任意m≥2的简单通路Pm的不交并图G∪Pm是优美图；进一步研究了(s〈c4,n〉)∪Pm的优美性,证明了当ni＞2,ti≥1,m≥2时,图r∪i=l(2ti〈c4,ni〉)∪Pm是优美图.其中:图〈c4,n〉是将n个c4中的每一个c4的一个顶点粘接在一起得到的新图,(s〈c4,n〉)∪Pm是s个〈c4,n〉与一个Pm的不交并.
Abstract
The present article proves the fact that the graph GUPm which is the disjoint union of an alternating graph G with given conditions and an path Pm with m≥2 edges is a graceful graph. Furthermore the article does the research on the gracefulness of ( s < c4, n ) ) U Pm, which proves thatU (2tt (c4, ni) ) U Pm is graceful in case that ni > 2, I, ti≥1, m ≥2, in which the graph ( c4, n ) isachieved by identifying a vertex of each c4 of nc4 with one vertex and the graph (s(c4,n) ) U Pm is thedisjoint union of s{c4,n) and Pm.
关键词
优美标号/优美图/非连通图/路Key words
graceful label/graceful graph/unconnected graph/path引用本文复制引用
出版年
2012
NETL
NSTL
维普
万方数据