关键词：graph 

摘要：I. Cahit calls a graph H-cordial if it is possible to label the edges with the numbers from the set{1,-1} in such a way that, for some k, at each vertex v the sum of the labels on the edges incident with v is either k or-k and the inequalities |v(k)-v(-k)| ≤ 1 and|e(1)-e(-1)| ≤ 1 are also satisfied. A graph G is called to be semi-H-cordial, if there exists a labeling f, such that for each vertex v, |f(v)| ≤ 1, and the inequalities |e_f(1)-e_f(-1)| ≤ 1 and |vf(1)-vf(-1)| ≤ 1 are also satisfied. An odd-degree(even-degree) graph is a graph that all of the vertex is odd(even) vertex. Three conclusions were proved:(1) An H-cordial graph G is either odd-degree graph or even-degree graph;(2) If G is an odd-degree graph, then G is H-cordial if and only if |E(G)| is even;(3) A graph G is semi-H-cordial if and only if |E(G)| is even and G has no Euler component with odd edges.

数学季刊杂志要求:

{1}基金项目格式：项目来源+项目编号。

{2}资助声明,如果文章有资助，则需要列明。作者必须列明所有外部资金来源，并描述资助者或发起人在整个研究过程(从研究设计到论文提交)中所扮演的角色。

{3}参考文献：论著文章要求15条以上，主要引用近3～5年内的新文献。按GB7714-87《文后参考文献著录规则》采用顺序编码著录，依照其在文中出现的先后顺序用阿拉伯数字标出。

{4}中文摘要及关键词：中文摘要一般在200字之内，包括目的、方法、结果、结论四个要素。

{5}稿件请写清作者的真实姓名、工作单位、详细通讯地址、邮政编码、联系电话及电子信箱等相关资料。

注：因版权方要求，不能公开全文，如需全文，请咨询杂志社