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

几种特殊图之间和的Cordial性
引用本文:连博勇,刘峙山.几种特殊图之间和的Cordial性[J].延边大学理工学报,2009,35(1):12-14.
作者姓名:连博勇  刘峙山
作者单位:仰恩大学,数学系,福建,泉州,362014  
摘    要:给出了路Pm、圈Cn、扇Fp和轮Wq4种图之间和的Cordial性,所得结果扩展了文献Eli(Gallian J A. A Dynamic Survey of Graph Labellings of Graphs. Electronic Journal of Combinatorics,2005(5):DS6)的研究工作.

关 键 词:Cordial图  图的和        

On the Cordiality of the Join of Some Special Graphs
LIAN Bo-yong,LIU Zhi-shan.On the Cordiality of the Join of Some Special Graphs[J].Journal of Yanbian University (Natural Science),2009,35(1):12-14.
Authors:LIAN Bo-yong  LIU Zhi-shan
Affiliation:( Department of Mathematics, Yang en University, Quanzhou 362014, China )
Abstract:The cordiality of the join of path, cycle, fan and wheel are investigated. The results extend the work of the reference 1] (Gallian J A. A Dynamic Survey of Graph Labellings of Graphs. Electronic Journal of Combinatorics, 2005 (5) : DS6).
Keywords:Cordial graph  join of graphs  path  cycle  fan  wheel
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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