Δ(G)≤2的图的Cordial性  

On Cordiality of The Graph Whoes Δ(G)≤2

作　　者：徐丽平[1] 李治[1] 

机构地区：[1]长江大学信息与数学学院,湖北荆州434023

出　　处：《长江大学学报（自科版）（上旬）》2014年第9期10-12,3,共3页JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG

基　　金：湖北省教育厅科学技术研究计划青年人才项目(Q20141306);长江大学自然科学培育项目(2013cjp09)

摘　　要：目前关于并图的Cordial性的研究仅限于分支十分简单的图,如关于圈的并只限于2个分支Cm∪Cn,或虽是多个分支但各图的阶数必须相同的情况,而对于分支为路与圈的并图的Cordial性尚无人考虑。Δ(G)≤2的图可以分为Δ(G)=0、Δ(G)=1、Δ(G)=2这3类,分别研究了Δ(G)=0、Δ(G)=1、Δ(G)=2的图的Cordial性。The study of the cordiality of the union graph is merely on the graph whose components are very simple. Such as Cm∪Cn. But cordiality of the union graph whose components are paths and cycles is not considered. In this paper,the cordiality of the graph whose Δ( G) ≤ 2 is studied. It includes all the conditions of the union graph whose components are paths and cycles.

关 键 词：Cordial标号 CORDIAL图 并图 

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