期刊文献+

完备二分图的冠的k—优美性 被引量:1

The K—Gracefulness of the Cornonal of Complete Bipartite Graphs
下载PDF
导出
摘要 图的优美性是图的重要研究内容之一,有广泛的应用背景.1991年,马克杰提出猜想:完备二分图km,n的冠I(km,n)是k—优美图,其中m,n,k是任意正整数且m≤n.当m=2,3,4,5或k>(m-2)n;m=1,2;或k≥(m-2)(n-1)的情形,在文献〔6,7〕中证明了猜想的正确性.本文利用构造方法也给出了对于任意正整数m,n,k时,当m<n,m≥6,n≥m2-3m+2/2时,完备二分图km,n的冠I(km,n)的另一种k—优美标号. The gracefulness of graphs which having widely applications is an important property of graphs. Makejie guessed that the coronal I(Km,n) of any complete bipartite graph Km,n is a K-graceful graph,where m,n,k are any positive integers and m ≤ n. In this paper, we proof the coronal I(Km,n ) of any complete 2 bipartite graph Km,n is a K-graceful Graph when m ≥6,n ≥(m^2-3m+2)/2 m〈n and m,n,k are any positive integers. Furthermore,the coronal I(Km,n ) of any complete bipartite graph Km,n is not K-graceful graph. The result enriches the graceful theory of graphs.
出处 《内蒙古民族大学学报(自然科学版)》 2012年第2期129-131,139,共4页 Journal of Inner Mongolia Minzu University:Natural Sciences
基金 内蒙古自治区高等学校科学项目(NJZY11198)
关键词 完备二分图 K-优美图 构造方法 Complete bipartite graphs k-graceful graph Crown Construction method
  • 相关文献

参考文献6

二级参考文献21

  • 1路线,潘伟,李秀芬.图St(m)∪K_(p,q)的k优美性及算术性[J].吉林大学学报(理学版),2004,42(3):333-336. 被引量:8
  • 2杨元生,容青,徐喜荣.一类优美图[J].Journal of Mathematical Research and Exposition,2004,24(3):520-524. 被引量:14
  • 3康庆德.积图P_m×C_(4n)的k-优美性[J].Journal of Mathematical Research and Exposition,1989,9(4):623-627. 被引量:8
  • 4刘育兴.图K_(m,n)∪K_(p,q)的k优美性[J].大学数学,2007,23(1):90-93. 被引量:5
  • 5Jallian J A.A dynamic survery of graph labeling[J].The electronic journal of combinatorics,2000(6):1-79.
  • 6Ringel G. Problem 25 in Theory of Graph and Its Applications [ M ]. Smolenice:Proc Symposium Smolencie, 1963:162 - 167.
  • 7Rosa A. On Certain Valuations of the Vertices of a Graph Theory of Graphs Proc [ M ]. Internat:Sympos Rome, 1966:349 - 355.
  • 8Golomb S W. How to Number a Graph : Graph Theory and Computing[ M ]. Now York : Academic Press, 1972:23 - 37.
  • 9Gnanajothi R B. Topic in Graph Theory[ D]. Thesis: Madurai Kamaraj University, 1991.
  • 10Bermond J C. Graph Theory and Combinatorics [ M ]. London : Ptiman, 1979 : 13 - 37.

共引文献1

同被引文献4

  • 1杜之亭,孙惠泉.n·C_(2P)的优美性[J].北京邮电大学学报,1994,17(3):85-89. 被引量:9
  • 2Jirimutu, Xu Xirong, Feng Wei, et al. Proof of a conjecture on the gracefulness of a digraph [ J ]. Utilitas Math, 201 0, 81: 255-264.
  • 3J A Bondy, U S R Murty. Graph theory with Applications [ M]. New York:Macmillan, London and Elsevier, 1976.
  • 4丁孝全.图2Cn是优美有向图[J].赣南师范学院学报,2000(2):12-14. 被引量:3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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