A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Cordial and 3-Equitable Labeling for Some Star Related Graphs Page 1 International
Mathematical Forum, 4, 2009, no. 31, 1543 - 1553 Cordial and 3-Equitable Labeling for Some …

Let G be a (p, q) graph. Let f: V (G)→{1, 2,..., p} be a function. For each edge uv, assign the
label| f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and| ef (0) …

Some Graceful Graphs Page 1 www.ccsenet.org/jmr Journal of Mathematics Research Vol.
4, No. 1; February 2012 Some Graceful Graphs VJ Kaneria (Corresponding author) …

In this paper we prove that the graph obtained by joining two copies of fan graph (Fn= Pn+
K1) by a path of arbitrary length is cordial. Further we prove that the star of fan graph is …

CORDIAL LABELING OF GRID RELATED GRAPHS Page 1 CORDIAL LABELING OF GRID
RELATED GRAPHS GV Ghodasara, AH Rokad & II Jadav ABSTRACT: We discuss here …

A new graph is introduced which is denoted as Cn (Cn). It is the graph obtained by taking
barycentric subdivision of cycle and joining each newly inserted vertices of two incident …

Let G be a (p, q) graph. Let f: V (G)→{1, 2..., p} be a function. For each edge uv, assign the
label| f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and| ef (0) …

Some Cycle Related Cordial Graphs in the Context of Vertex Switching Page 1 Proc. ICDM
2008, RMS-Lecture Notes Series No. 13, 2010, pp. 243–252. Some Cycle Related Cordial …

In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph.
We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit …