具有奇优美性的一类龙图  

A Class of Dragon Graphs with Odd-Gracefulness

作　　者：刘信生[1] 刘元元[1] 姚兵[1] 缑艳[1] 李峰[1] 

机构地区：[1]西北师范大学数学与统计学院,兰州730070

出　　处：《西南大学学报（自然科学版）》2014年第4期47-51,共5页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61163054;61163037);甘肃省自然科学基金(3ZS051-A25-025)

摘　　要：根据复杂网络研究的需要,定义了(k,m)-龙图和一致(k,m)-龙图,这类图具有优美性、奇优美性等性质.主要研究了这类龙图的奇优美性,定义了这类龙图的奇优美标号,其证明方法可算法化.Based on the need of research of complex networks,we define a class of graphs,called（k,m）-dragon graphs and uniformly（k,m）-dragon graphs,which are graceful or odd-graceful.We propose and define the notion of odd graceful labelings of dragon graphs and investigate their odd-gracefulness in detail. Our methods can be algorithmic.Through the definition of dragon graphs and proofs of their theorems,we get some simple but useful conclusions.

关 键 词：龙图 奇优美标号 奇优美图 

分 类 号：O157.5[理学—数学]