關鍵詞：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}稿件請寫清作者的真實姓名、工作單位、詳細通訊地址、郵政編碼、聯系電話及電子信箱等相關資料。

注：因版權方要求，不能公開全文，如需全文，請咨詢雜志社