On k-cordial labelling

Youssef, Maged Z.;

Abstract


In this paper we give some necessary conditions for a graph to
be k-cordial for certain k. We also give some new families of 4-cordial
graphs.

Hovey [Discrete Math. 93 (1991), 183–194] introduced simultaneous gen eralizations of harmonious and cordial labellings. He defines a graph G of
vertex set V (G) and edge set E(G) to be k-cordial if there is a vertex la belling f from V (G) to Zk, the group of integers modulo k, so that when
each edge xy is assigned the label (f(x) + f(y)) (mod k), the number of
vertices (respectively, edges) labelled with i and the number of vertices
(respectively, edges) labelled with j differ by at most one for all i and
j in Zk. In this paper we give some necessary conditions for a graph to
be k-cordial for certain k. We also give some new families of 4-cordial
graphs.


Other data

Title On k-cordial labelling
Authors Youssef, Maged Z. 
Keywords Harmonious graphs, k-cordial graphs, graceful graphs
Issue Date 1-Feb-2009
Publisher AUSTRALASIAN JOURNAL OF COMBINATORICS
Journal AUSTRALASIAN JOURNAL OF COMBINATORICS 
Volume 43
Start page 31
End page 37

Attached Files

Recommend this item

Similar Items from Core Recommender Database

Google ScholarTM

Check



Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.