期刊文献+

两类图的优美性(英文) 被引量:2

The Gracefulness of Two Types of Graphs
下载PDF
导出
摘要 马克杰已经证明:任何连通亚完备二分图都是优美的.Hoede与Kuiper得到了:任何轮图都是优美的.我们证明:任何亚完备二分图都是优美图,k优美图,平衡二分图,这里k表示任意正整数.而且,通过构造的方法得到了:阶至少是3的任何轮图的冠都是优美图. K. Ma proved that any connected quasi complete bipartite graph is graceful. Hoede and Kuiper obtained that any wheel is graceful. In this paper, we prove that any quasi complete bipartite graph is a graceful graph, a K -graceful graph and an alternative bipartite graph, where K is any positive integer. Furthermore, it is showed that the coronal of every wheel of order at least three is a graceful graph by construction method.
出处 《昆明理工大学学报(自然科学版)》 CAS 北大核心 2014年第1期114-121,共8页 Journal of Kunming University of Science and Technology(Natural Science)
基金 National Natural Science Foundation of China(10901048)
关键词 亚完备二分图 优美图 平衡二分图 构造方法 quasi complete bipartite graph graceful graph alternative bipartite graph coronal construction method
  • 相关文献

参考文献1

二级参考文献7

共引文献4

同被引文献9

  • 1Lee S M,Liu A,Tan S K.On balanced graphs[J].Congr Numer,1992,87:59-64.
  • 2Lee A N T,Lee S M,Ng N K.On the balance index sets of graphs[J].J Combin Math Combin Comput,2008,66:135-150.
  • 3Mark Hovey.A-cordial graphs[J].Discrete Mathematics,1991,93(2/3):183-194.
  • 4Cahit I.On cordial and 3-equitable labellings of graphs[J].Utilitas Math,1990,37:189-198.
  • 5Niall Cairnie,Keith Edwards.The computational complexity of cordial and equitable labelling[J].Discrete Mathematics,2000,216(1/3):29-34.
  • 6Seoud M A,Abdel Maqsoun A E I.On cordial and balanced labelings of graphs[J].J Egyptian Math Soc,1999,7(1):127–135.
  • 7Seahe.On the construction of cordial graphs[J].Ars Combin,1991,31:249-254.
  • 8Shiu W C,Kwong H.Algebraic approach for finding balance index sets[J].Australasian Journal of Combinatorics,2009,45:139-155.
  • 9张家娟,郭璟霞,周向前,姚兵.优美图的一些性质[J].数学的实践与认识,2012,24(13):197-201. 被引量:7

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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