首页 | 本学科首页   官方微博 | 高级检索  
     检索      

任意n个完备二分图的并图的k-优美性和算术性
引用本文:刘育兴,严深海.任意n个完备二分图的并图的k-优美性和算术性[J].工科数学,2012(5):46-49.
作者姓名:刘育兴  严深海
作者单位:赣南师范学院数学与计算机科学学院,江西赣州341000
摘    要:证明了对于正整数k,n,si,ti(si,ti≥2,i=1,2,…,n),图n/U/i=1,Ksi,ti是k-优美图;对于正整数k,d(d≥2),k≠0(roodd)及n,si,ti(si,ti≥2,i=1,2,…,n),图n/U/i=1,Ksi,ti是(k,d)-算术图,前一结论推广了文6]的相应结果。

关 键 词:完备二分图  并图  优美图  算术图

The Gracefulness and Arithmetics of the Unions of Arbitrarily n Complete Bipartite Graphs
LIU Yu-xing,YAN Shen-hai.The Gracefulness and Arithmetics of the Unions of Arbitrarily n Complete Bipartite Graphs[J].Journal of Mathematics For Technology,2012(5):46-49.
Authors:LIU Yu-xing  YAN Shen-hai
Institution:(Department of Mathematics and Computer, Gannan Normal College, Ganzhou 341000,China)
Abstract:It is proved that the unions of arbitrarily n complete bipartite graphs is a k - graceful graph for any positive integerk ,and that the unions of arbitrarily n complete bipartite graphs is a (k,d)- arithmetic graph for any positive integers k ,d ( d ≥2), k ≠0( rood d) . The preceding conclusion generalizes the correspondent results in 6].
Keywords:complete bipartite graph  union graph  graceful graph  arithmetic graph
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号