[1]倪臣敏,刘峙山,卢福良.一种联图的Cordial性[J].华侨大学学报(自然科学版),2014,35(1):117-120.[doi:10.11830/ISSN.1000-5013.2014.01.0117]
　NI Chen-min,LIU Zhi-shan,LU Fu-liang.On the Cordiality of a Union of Graphs[J].Journal of Huaqiao University(Natural Science),2014,35(1):117-120.[doi:10.11830/ISSN.1000-5013.2014.01.0117]
点击复制

一种联图的Cordial性()
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第35卷
期数:
2014年第1期
页码:
117-120
栏目:
出版日期:
2014-01-20

文章信息/Info

Title:
On the Cordiality of a Union of Graphs
文章编号:
1000-5013(2014)01-0117-04
作者:
倪臣敏1;  刘峙山2;  卢福良3
1. 华侨大学 厦门工学院高等数学教学系, 福建 厦门 361021;2. 仰恩大学 数学系, 福建 泉州 362014;3. 临沂大学 数学系, 山东 临沂 276005
Author(s):
NI Chen-min1;  LIU Zhi-shan2;  LU Fu-liang3
1. Teaching Department of High Mathematics of Institue of Technology, Huaqiao University, Xiamen 361021, China; 2. Department of Mathematics, Yangen Universiyty, Quanzhou 362014, China; 3. Department of Mathematics, Linyi Universiyty, Linyi 276005, China
关键词:
第一类图;  路;  联;  Cordial图
Keywords:
the first class of graphs;  path;  union;  cordial graph
分类号:
O157.5
DOI:
10.11830/ISSN.1000-5013.2014.01.0117
文献标志码:
A
摘要:
引入第一类图G的概念, 即若存在一个标号f, 使得|v0(G)-v1(G)|≤1,e0(G)≥e1(G), 则称G为第一类图. 证明了第一类图G与路P的联图G∨P, 当P的阶数大于等于G的最大度的2倍加2, 即|P|≥2Δ(G)+2时,都是Cordial图,并进一步给出图G是第一类图的两个充分条件.
Abstract:
The first class of graphs is introduced. If a graph has a lebaling f, s.t. |v0(G)-v1(G)|≤1,e0(G)≥e1(G), it is called to be the first class of graphs.Let G be a graph of this class and P be a path with |P|≥2Δ(G)+2, it is proved that G∨P is a Cordial graph, and two sufficient conditions are given to make G to be the first class of graphs.

参考文献/References:

[1] CAHIT I.Cordial graghs: A weak version of graceful and harmonious graphs[J].Ars Combin,1987(23):201-208.
[2] JOSEPH A G.A dynamic survey of graph labeling[J].Electronic Journal of Combinatorics,2009(16):49-53.
[3] ANDAR M,BOXWALA S,LIMAYE N B.On the cordiality of the t-uniform homeomorphs-I[J].Ars Combin,2003(66):313-318.
[4] ANDAR M,BOXWALA S,LIMAYE N B.On the cordiality of the t-uniform homeomorphs-II[J].Ars Combin,2003(67):213-220.
[5] 倪臣敏,刘峙山,陈丽娜.关于一点联的Cordial 性的一个结果的推广[J].延边大学学报:自然科学版,2007,33(2):94-97.
[6] XIE Yan-tao,CHE Ying-tao,LIU Zhi-shan.The cordiality on the union of 3-regular connected graph and cycle[J].Chinese Quarterly Journal of Mathematics,2010,25(2):244-248.
[7] 刘群,刘峙山.最大边数的Cordial图的构造[J].数学研究,2003,36(4):437-439.
[8] 刘峙山,堵根民.三正则连通图的Cordial性[J].数学研究,2007,40(1):114-116.
[9] GHEBLEH M,KHOEILAR R.A note on “H-cordial graphs”[J].Bull Inst Combin Appl,2001(31):60-68.
[10] KIRCHHERR W W.NEPS operations on cordial graphs[J].Discrete Math,1993(115):201-209.
[11] BONDY J A,MURTY U S R.Graph theory with applications[M].New York: American Elsevier,1976:117-118.

备注/Memo

备注/Memo:
收稿日期: 2012-12-19
通信作者: 倪臣敏(1980-),女,讲师,主要从事图论与组合学,图像处理与分析的研究.E-mail:cmni@163.com.
基金项目: 国家自然科学基金资助项目(11226288)
更新日期/Last Update: 2014-01-20