Graceful Labeling for Some Star Related Graphs

access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We have investigate graceful labeling and cordial labeling for the graphs obtained by joining apex vertices of some star graphs to a new vertex.

1 Introduction : We begin with the simple, connected, undirected and finite graph G = (V, E).For all standard terminology and notations we follow Harary [4].We will give brief summery of definitions which are used in this paper.

Definition−1.1:
If the vertices of the graph are assigned values subject to certain conditions then it is known as graph labeling.
Definition−1.2:Given a graph G = (V, E), the set N of non−negative integers and a commutative binary operation * : N × N → N , every vertex . ., q} is injective and the induced function graph which admits graceful labeling is called graceful graph.
For an edge e = uv, the induced function f * : E → {0, 1} is given as be number of vertices of G having labels 0 and 1 respectively under f and let e f (0), e f (1) be number of edges of G having labels 0 and 1 respectively under f * .
A binary vertex labeling A graph which admits cordial labeling is called cordial graph.
For an edge e = uv the induced edge labeling f * : E →{0,1,2} is given by be the number of vertices of G having labels 0,1 and 2 respectively under f and let e f (0),e f (1),e f (2) be the number of edges having labels 0,1 and 2 respectively under f * .
A ternary vertex labeling of a graph For detail survey of graph labeling one can refer Gallian [3].Vast amount of literature is available on different type of graph labeling.Labeled graphs have variety of applications in coding theory particularly missile guidance codes.A detail study of variety of applications of graph labeling is given by bloom and Golomb [1].
Graceful labeling for some star related graphs 1291 The graceful labeling was introduced by A. Rosa [5] during 1967.He proved that the cycle C n is graceful, when n ≡ 0, 3 (mod 4).Rosa [5] and Golomb [2] proved that the complete graph bipartite graphs K m,n are graceful.Vaidya et al. [6] proved a graph obtained by some copies of star by joining their apex with a new vertex is cordial as well as 3−equitable.
2 Main Results : The graph G obtained by joining some stars . ., t be vertices of star graphs K 1,n i , i = 1, 2, . . ., t.We shall join these graphs K 1,n i and K 1,n i+1 by new vertex u i , where 1 ≤ i ≤ t − 1 by their apex vertices.We define labeling function f : V −→ {0, 1, . . ., q}, where q = Σ t i=1 n i +(2t − 2) as follows: The above labeling pattern give rise graceful labeling to the given graph G.

Figure−1
Let v f (odd), v f (even) be the number of vertices of a graceful graph G with labeling function f having odd labels and even labels respectively under f .Also e f (even)= the number of even edge label of the graph G, e f (odd)= the number of odd edge label of the graph G under the corresponding function f .We know that for a graceful graph G with graceful labeling f , |e f (odd)−e f (even)| ≤ 1.This property will help for following result.
Theorem−2.3 : For a graceful graph G with graceful labeling f , if it satisfies Proof : We define g : V −→ {0, 1}, the binary vertex labeling for G as follows:  1, where f is graceful labeling for G and so every graceful graph may not be cordial.We know that K 4 is graceful graph, while it is not a cordial graph as in K 4 , v f (odd)= 1 and v f (even)= 3.
Proof : Above graph G is a tree and so the number of vertices for G is q + 1, where q = the number of edges for G, which is here Σ t i=1 n i + 2(t − 1).So the graceful labeling f for G is bijective map.Hence it satisfies |v f (odd)−v f (even)| ≤ 1. Therefore by Theorem−2.3G is a cordial graph.

Concluding Remarks :
Labeled graph is the topics of current interest.We discussed here graceful labeling and cordial labeling of some star related graphs.In [6] vaidya et al. proved that the graph obtained by < K 1 1,n ; K 2 1,n ; . . .; K k 1,n > (k copies of K 1,n ) is cordial graph, which is particular case of our Corollary−2.5by taking n 1 = n 2 = . . .= n t = n and t = k.
and its graceful labeling is shown in following Figure−1.
u has odd vertex label and f (u) = 0 if u has even vertex label under graceful labeling f .Then we see that |v g (0) − v g (1)| ≤ 1 and |e g (0) − e g (1)| ≤ 1, because e g (0) = e f (even) and e g (1) = e f (odd), where v g (0), v g (1) be number of vertices of G having labels 0 and 1 respectively under g and let e g (0), e g (1) be number of edges of G having labels 0 and 1 respectively under the induced function g * by g.Therefore G admits a cordial labeling g and so G is a cordial graph.Illustration−2.4:K 4,3 with its graceful labeling and the corresponding cordial labeling is shown in following Figure−2.