International Journal of Computer Applications (0975 – 8887)

Volume 8– No.8, October 2010

Even Vertex Gracefulness of Fan Graph

A. Solairaju P. Muruganantham
Associate Professor. Head, Department Of Mathematics
Jamal Mohamed College Kurinji College Of Arts & Science
Tiruchirappalli-20 Tiruchirappalli-02

Abstract: A graph is even vertex graceful Section I : Preliminaries

if there exists an injective map
Definition 1.1: Let G = (V,E) be a simple graph
f : E (G) {1,2,…,2q} so that the induced map
with p vertices and q edges.
+
f: V(G) {0,2,4,…,2k-2} defined by A map f :V(G) {0,1,2,…,q} is
+
f (x) = f(xy) (mod 2k) where k= max { p, q } called a graceful labeling if
makes all distinct. f is one – to – one
In this paper, we prove that Fan graphs F(nC3), The edges receive all the labels (numbers) from
F(nC5) and F(2nC3) are all even vertex graceful, 1 to q where the label of an edge is the absolute
where n is any positive integer. value of the difference between the vertex labels
Introduction: A.Solairaju, and A.Sasikala at its ends.
[2008] got gracefulness of a spanning tree of the A graph having a graceful labeling is called a
graph of product of Pm and Cn, A.Solairaju and graceful graph.
K.Chitra [2009] obtained edge-odd graceful Definition 1.2: A graph is even vertex graceful
labeling of some graphs related to paths. if there exists an injective map
A.Solairaju and C.Vimala [2008] also got f : E (G) {1,2,…,2q} so that the induced map
gracefulness of a spanning tree of the graph of +
f: V(G) {0,2,4,…,2k-2} defined by
Cartesian product of Sm and Sn,
f+ (x) = f(xy) (mod 2k) where k = max { p, q }
A.Solairaju and P.Muruganantham
makes all distinct.
[2009] proved that ladder P2 x Pn is even-edge
Definition 1.3: A graph is odd-edge graceful if
graceful (even vertex graceful). They found
there exists an injective map
[2010] the connected graphs Pn o nC3 and
f : E (G) {1,3,5, …, 2q} so that the induced
Pn o nC7 are both even vertex graceful, where n is
map f+: V(G) {0,1,2,3 ,…, 2k-2} defined by
any positive integer. They also obtained [2010]
+
f (x) = f(xy) (mod 2k) where k = max { p, q }
that the connected graph Pn Δ nC4 is even vertex
makes all distinct.
graceful, where n is any even positive integer.

1
 International Journal of Computer Applications (0975 – 8887)
Volume 8– No.8, October 2010

Example 1.4: The following connected graph is Define a map f: E[F(nC3)] {0, 1,2,…, 2q} by
even vertex graceful. f (ei) = (2i-1), i=1 ,…, 3n.
Then the induced map f+ (u) = ∑ f(uv)
42 46
40
48 (mod 2q) where the sum runs over all edges uv
7 9

36
through v. Now, f and f+ both satisfy even vertex
33 35 37 39 52
5 31 graceful labeling as well as edge–odd graceful
34 11
29 41 54
labeling. Thus the connected graph F(nC3) is
43
30 27 20
3 45
58 both even vertex graceful and odd-edge
25 13
28 47 0 graceful.
23

21 49 Theorem 2.2: If n = 1 (mod 3), the fan graph

24 1 51 4
59 57 55 53
15 F(nC3) is even vertex graceful.
22 6
Proof: The graph F(nC3) is chosen with some
19 17
18 10
16 12 arbitrary labeling of edges as in the following
diagram.
Definition 1.5: A fan graph or a friendship graph
en-3 en-2
F(nC3) is defined as the following connected
graph containing n copies of circuits of each
en-1

-4
e3n-5
e3n
e3n-
length 3 with some arbitrary labeling of edges. e3n-3
e3n-7

6
e3n+2 e3n+1 e3n-2
e6
en+12
e3n e3n-1
e2n- 2 1
e2n-3
e2n-4

e2n-

en+11 en
e2n

e2n e3n
-5

e2n+9 e18 e1 en+10

e2n+1 e5 en+1
e2 e n+ 9
e17 en+2
e3
en+3 e1
e16 e2n+2 +8
e4 en
7

e2n+8 en+4
en+

en+5
e15 en+6
e5
e14 e4
e6 e2
e13 e12 e7 e2n+3
e2n+7 e11 e10 e9 e8
e3
e2n+6 e2n+4 Define a map f: E[F(nC3)] {0, 1,2,…, 2q} by
e2n+5
Section 2: Even vertex graceful of fan graph f (ei) = 2i, i = 1 ,…, 3n.
Few contributions on (friendship graph) fan Then the induced map f+ (u) = ∑ f(uv) (mod 2q)
graph are given below. where the sum runs over all edges uv
Notation: p and q denote the number of vertices through v. Now, f and f+ both satisfy even
and edges of a graph respectively. vertex graceful labeling. Thus the connected
Theorem 2.1: If n = 0 (mod 3), the fan graph graph F(nC3) is even vertex graceful .
F(nC3) is even vertex graceful.
Proof: The graph F(nC3) is chosen with some
arbitrary labeling of edges as in definition (1.5).

2
 International Journal of Computer Applications (0975 – 8887)
Volume 8– No.8, October 2010

Theorem 2.3: If n = 2 (mod 3), the fan graph copies of circuits of each length 5 with some
F(nC3) is even vertex graceful. arbitrary labeling of edges.
Proof: The graph F(nC3) is chosen with some
arbitrary labeling of edges as in the following
diagram.

e2
e3n - 1

e5
e1
-4

e3
e3n
e3 n

e4
e3n

e6
e3n
-2

-3
e7 e8
e3 n - 5
e9
e3 n - 7

e3n - 6 e10
e3n - 8 e 11
e12
e 13
e2 7
e15
e25
e1 6

e14
e18

e26
e
e22
e21
e1 9

Theorem 3.1: The fan graph F(nC5) is even

24

vertex graceful.
e1 7
e23

Proof: An arbitrary labeling of edges of F(nC5)

e20

f (ei) = 2i for i = 1,2,3; f(ei) = (2i-1), i = 4,5,6; is followed from definition (3.1).
f (ei) = (2i-6),i = 7, 8, 9, 13, 14, 15,…, (3n-5), Define f: E (F(nC5) ) { 1,2, …, 2q} in the
(3n-4), (3n-3). following manner:
f(ei) = 2i-7, i = 10, 11, 12 ,…, (3n-8), (3n-7), Case (i) n is odd
(3n-6). f (ei)= (2i-1), i = 1, 2 ,3 ,..., q.
Subcase (a): n ≡ 2 (mod 3) ≡ 2 (mod 6) Case (ii) n is even
f(e3n-1) = 2q, f(e3n) = (2q-4), f(e3n-2) = (2q-8). f (ei)= 2 (i + 2 ), i = 1, 2, 3, 4, 5;
Subcase (b): n ≡ 2 (mod 3) ≡ 5 (mod6) f(e10k + i) = f (ei) + 10k, k=1, 2 ,…., (n / 2),
f(e3n-1) = 2q, f(e3n) = (2q-2), f(e3n-2)=2q-6. i = 1, 2, 3, 4, 5;
Then the induced map f+ (u) = ∑ f(uv) (mod 2q) f(ei) = (2i-11), i = 6, 7, 8, 9, 10;
where the sum runs over all edges uv through v. f(e10k+i) = f(ei) + (10k), k = 1, 2 ,…., (n / 2),
+
Now, f and f both satisfy even vertex graceful i = 6, 7, 8, 9, 10.
labeling. Thus the connected graph F(nC3) is +
Then the induced map f (u) = ∑ f(uv) (mod 2q)
even vertex graceful. where the sum runs over all edges uv through v.
Main theorem 2.4: The fan graph F(nC3) is even Now, f and f+ both satisfy even vertex graceful
vertex graceful. labeling. Thus the connected graph F(nC5) is
Section 3 – Even vertex graceful of fan graph even vertex graceful
F(nC5). Definition 3.2: The fan graph F(2nC3) is a
Definition 3.1: The fan graph F(nC5) is a defined defined as the following connected graph
as the following connected graph containing n containing 2n copies of circuits of each length 3
with some arbitrary labeling of edges.

3
 International Journal of Computer Applications (0975 – 8887)
Volume 8– No.8, October 2010

e2n e1 REFERENCES:
e2n -
1 e2

e5n

e2n+1
e4n+1
e4n 1. A. Solairaju and K.Chitra, Edge-odd

e4n

e3
e2n+2
-2

+3
e4n graceful labeling of some graphs,

-1

e2n
e2n

e4
-2 2
n+ Electronics Notes in Discrete Mathematics
-3

e4
e2n

e5n - 1 +4
e2n Volume 33, April 2009, pp. 15.
e4n - e2n+5

e5 e6
3
e4n+3 2. A. Solairaju and P.Muruganantham, even-
e2n+16 edge gracefulness of ladder, The Global
e16 e4n+8 e2n+6
Journal of Applied Mathematics &
e15 5
e2n+7 Mathematical Sciences(GJ-AMMS).
e2n+1 2n+14 e4n
e +4 Vol.1.No.2, (July-December-
7 e2n

e7
n+ +8
e4 2008):pp.149-153.
e14
3

e2n 5
e4n+6

e8
+1

e2ne
e4n+
e2n+12
e2n

e13 3. A. Solairaju and P.Muruganantham, even

+9
+10
2n+11

vertex gracefulness of path merging circuits,

Indian Journal of Mathematics and
e9

e12 e11
e10

Mathematical Sciences, Vol. 6, No.1, (June,

Theorem 3.2: The fan graph F(2nC3) is even
vertex graceful.
Proof: An arbitrary labeling of edges of F(2nC3)
is followed from the definition (3.2).
Define f: E (F(2nC3) )
following manner:
f(ei) = 2i, i = 1, 2, 3 ,..., 4n;
Case (1) n ≥ 8 and n is even : f(e4n + i) = (2q-
4i), i = 1, 2, 3 ,..., n.
Case (2) n ≡ 1 (mod4) : f(e4n+i) = 2q-8(i-1),
i = 1, 2, 3 ,..., n.
Case (3) n ≡ 3 (mod4) : f(e4n + 1) = (2q-2);
f(e4n + i) = f(e4n + 1) – 8 (i-1), i = 2, 3 ,..., n.
Then the induced map f+ (u) = ∑ f(uv)
(mod 2q) where the sum runs over all edges uv
through v. Now, f and f+ both satisfy even vertex
graceful labeling. Thus the connected graph
F(2nC3) is even vertex graceful.
2010), pp.27 – 31.
4. A. Solairaju and P.Muruganantham, even
vertex gracefulness of even number of
copies of C4, accepted for publication in
Serials Publications, New Delhi, India.
5. A.Solairaju, and A.Sasikala, Gracefulness of
{ 1,2, …, 2q} in the a spanning tree of the graph of product of Pm
and Cn, The Global Journal of Pure and
Applied Mathematics of Mathematical
Sciences, Vol. 1, No-2 (July-Dec 2008): pp
133-136.
6. A.Solairaju, and C.Vimala, Gracefulness of
a spanning tree of the graph of Cartesian
product of Sm and Sn, The Global Journal of
Pure and Applied Mathematics of
Mathematical Sciences, Vol. 1, No-2 (July-
Dec 2008): pp117- 120.