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


Strongly graceful graphs
Authors:Maryvonne Maheo
Institution:L.R.I., Université de Paris-sud, Centre d''Orsay, Bât. 490, 91405 Orsay, France
Abstract:In this paper, we prove that the n-cube is graceful, thus answering a conjecture of J.-C. Bermond and Gangopadhyay and Rao Hebbare. To do that, we introduce a special kind of graceful numbering, particular case of α-valuation, called strongly graceful and we prove that if a graph G is strongly graceful, G + K2 is also strongly graceful.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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