INTRODUCTION

Graph theory was born is 1736 with Eulers paper in which solved the
Konigsberg bridge problem. Go the next 100 years nothing more done in the field.
This theory is one of the most important branches of mathematics. Euler studied
graph theory as a mathematical discipline. When the discussed the famous
Konigsberg bridge problem.

A graph labeling is an assignment of integers to vertices or edge or both

subject were first introduced in the late 1960. Graphs are basic combinational and
graph labeling is an active area of research in graph theory. Labeling is an
assignment of label (numbers) to its vertices (edges) which satisfies some
conditions.

In 1970, Kotzig and Rosa defined a magic labeling of a graph G(V,E) as a

bijection f : V U E {1,2,.V+E} such that for all edges xyf(x )+f(y)+f(x y)
are the same. A graph is said to be magic if it has magic labeling.

This chapter is intended to discuss triangular sum labeling of graphs. We

show that some classes of graph can be embedded as an induced sub graphs of a
triangular sum graph.

We begin with simple, finite, connected and undirected graph

G=(V(G),E(G)) with p vertices and q edges. In a graph G, V(G)denotes the vertex

1
set and E(G) denotes the edge set. we will provide brief summary of definitions and
other information which are necessary for the present investigations.

Throughout this paper a graph G=(V,E) is a undirected. For different

notations and terminology we follow gross and yellan.A survey on different graph
labeling techniques is given by gallian.

Chapter I- we have given the basic definitions which are needed to this project.
Chapter II- we discuss about the triangular sum labeling for sub graph, path, cycle ,
one chord, and twin chord.
Chapter III- the concept of triangular sum labeling prime graph of paths pn ,star
K1,n and etc.
Chapter IV - the concept of prime labeling in context of ring sum of graphs ring,
path, cycle, one chord and twin chord are discussed.

2
 CHAPTER-I
PRILIMINARIES
DEFINITION: 1.1

A graph G= (V, E) consist of a set of V={v1,v2,.} called vertices and

another set E={e1,e2,.} whose elements are called edges. Such that each edge ek is
an identified with unordered pair (vi,vj) of vertices. The vertices (vi,vj)associated with ek
are called the end vertices of ek

.Example:

DEFINITION: 1.2

A graph that has neither self loops nor parallel edges is called simple graph.

Example:

V1 e1 V2

e4 e2

V3 e3 V4
3
DEFINITION: 1.3

A graph G is said to be connected if there is atleast one path between every pair of
vertices in G otherwise G is disconnected.

Example:

(i) Connected graph

(ii) Disconnected graph

(iii) DEFINITION: 1.4

A graph whose edge set is empty is called a null graph or a totally disconnected
graph.

Example: .v1

.v2 .v3

The graph G is a null graph.

4
DEFINITION: 1.5

If more then one line joining two vertices are allowed, the resulting object is called a
multi graph. Lines joining the same points are called multiple lines.

Example:

DEFINITION: 1.6

The degree of a point vi in graph G is the number of lines incident with vi, the
degree of vi is denoted by d(vi) or degree vi or simply d(vi).

Example:

D(v1)=3, d(v2)=2, d(v3)=4,d(v4)=2,d(v5)=2.

5
DEFINITION: 1.7

A point v of degree 0 is called an isolated point v of degree 1 is called pendent

vertex.

Example:

The vertices v1 and v3 are pendent vertices.

DEFINITION: 1.8

A vertex with odd degree is called an odd vertex.

DEFINITION: 1.9

A vertex with even degree is called an even vertex.

DEFINITION: 1.10

A simple graph in which there exist an edge between every pair of is called
complete graph.

6
Example:

DEFINITION: 1.11

If all the edges of a walk are distinct then it is called trail. An open walk in which
no vertex appears more than once is called a path and is denoted by pn with n vertices.

Example :

V1 e1 v2 e2 v3 e5 v4 is a path

7
 DEFINITION: 1.12

Two vertices which are incident with a common edge are adjacent vertices.

DEFINITION: 1.13

Two edges which are incident with a common vertex are adjacent edges.

DEFINITION: 1.14

A vertex having no incident edge is called an isolated vertex.

DEFINITION: 1.15

A disconnected graph consist of two or more connected graph. Each of these

connected sub graph are called a components.

DEFNITION: 1.16

Vertices with which a walk beginning and ending are called its terminal vertices.

8
Example:

DEFINITION: 1.17

A closed walk in which no vertex appears more than once except terminal vertices
is called a circuit. A circuit is also called a cycle.

Example:

e1 v2 e5 v5 e6 v3 e3 v4 e4 v1 is a circuit.

DEFINITION: 1.18

A direct graph G consist of a set of vertices V={v1, v2,.} a set of edges

E= {e1, e2,.} and a mapping the maps every edge onto some ordered pair of
vertices (vi, Vj)

9
Example:

DEFINITION: 1.19

A graph in which all vertices are of equal degree is called a regular graph.

Example:

DEFINITION: 1.20

A labeling of a graph is an assignment of integer to the vertices or edges.

10
DEFINITION: 1.21

If the domain of the mapping is the set of vertices then the labeling is called vertex
labeling.

Example:

DEFINITION: 1.22

If the domain of the mapping is the set of edges then the labeling is called edge
labeling.

Example:

DEFINITION: 1.23

A wheel is a graph obtained from a cycle by adding a new vertex and edge joining
it to all the vertices of cycle the new edges are called the spokes of the wheel.

The wheel of n vertices denoted by wn

11
Example:

DEFINITION: 1.24

A graph with a finite number of vertices as well as finite number of edges is called
as finite graph. Otherwise it is in infinite graph.

DEFINITION: 1.25

An edge having the same vertex as both its end vertices is called a self-loop.

DEFINITION: 1.26

If some closed walk in a graph contains all the edges of the graph then walk is

called an Euler line and the graph an Euler graph.

DEFINITION: 1.27

A connected graph that has a unicursal line will be called a unicursal graph.

DEFINITION: 1.28

The union of two graph G1=(V1 E1) and G2= (V2 E2) is another graph G1G2

whose vertex set V3=V1V2 and the edge set E3=E1UE2.

12
DEFINITION: 1.29

The intersection G1G2 of graphs G1 and G2 is a graph G1G2 consisting only of

those vertices and edges that are in both G1 and G2.

DEFINITION: 1.30

A Hamiltonian circuit in a connected graph G is defined as a closed walk that

traverses every vertex of G exactly once, except of course the starting vertex, at which

the walk also terminates.

13
 CHAPTER-II

TRIANGULAR SUM LABELING

This chapter summarizes important theorems about triangular graphs and there by

establishes fundamentals for the following chapters.

DEFINITION: 2.1

A triangular sum labeling of a graph G is a one-to-one function

f:V N (where N is the set of all non-negative integers) that induces a bijection

f+:E(G) {T1, T2,,Tq} of the edges of G defined by f+ (uv) = f(u) + f(v),

e= uv E(G).

The graph which admits such labeling is called a triangular sum graph.

DEFINITION: 2.2

A triangular number is a number obtained by adding all positive integers less than

or equal to a given positive integer n. If nth triangular number is denoted by Tn then

1
Tn = n(n+1). It is easy to observe that there does not exist consecutive integers which
2

are triangular numbers.

14
SOME IMPORTANT RESULTS ON TRIANGULAR SUM GRAPHS:

Lemma: 2.3

In every triangular sum graph G the vertices with label 0 and 1 are always adjacent.

Proof:

The edge label T1=1 is possible only when the vertices with label 0 and 1 are

adjacent.

Lemma: 2.4

In any triangular sum graph G, 0 and 1 cannot be the label of vertices of the same

triangle contained in G.

Proof:

Let a0,a1 and a2 be the vertices of a triangle. If a0 and a1 are labeled with 0 and 1

respectively and a2 is labeled with some x N, where x 0 x1.

Such vertex labeling will give rise to edge labels with 1,x and x+1. In order to

admit a triangular sum labeling x and x+1 must be triangular numbers.

Theorem: 2.5

Every cycle can be embedded as an induced sub graph of a triangular sum graph.

Proof:

Let G=cn be a cycle with n vertices. We define labeling f :V(G) N as follows

such that the induced function f+ :E(G) {T1,T2,...Tq} is bijective.

f(v1) = 0

15
 f(v2) = 6

f(vi) = Ti+2 f(vi-1); 3 i 1

f(vn) = (1) -1

Now let A = {T1,T2,Tr} be the set of missing edge labels. This is, elements of set

A are the missing triangular numbers between 1 and (1) -1 .Now add r pendant

vertices which are adjacent to the vertex with label 0 and label these new vertices with

labels T1,T2,Tr.

This construction will give rise to edges with labels T1,T2,Tr such that the
resultant super graph H admits triangular sum labeling. Thus we proved that every cycle
can be embedded as an induced sub graph of a triangular sum graph.

Example:

Embedding of C5 as an induced sub graph of a triangular sum graph is shown.

16
Theorem: 2.6

Every cycle with one chord can be embedded as an induced sub graph of a triangular sum
graph.

Proof:

Let G be the cycle with one chord and e= v1vk be the chord of cycle Cn. we define
labeling

f:V(G) N as follows such that the induced function f+:E(G) {T1,T2,Tr} is

bijective.

f(v1) = 0

f(v2) = 6

f(vi) =Ti+2 f(vi - 1); 3 1

f(vk) = (1) -1

f(vk+i -1) =(1) -1+if(vk+i 2); 2in k

f(vn) = (1) -1

Now the following the procedure described in previous theorem and the resultant

super graph H admits triangular sum labeling.Thus we proved that every cycle with one

chord can be embedded as an induced sub graph of a triangular sum graph.

Example:

Embedding of C4 with one chord as an induced sub graph of a triangular sum graph is

shown.
17
Theorem: 2.7

Every cycle with twin chords can be embedded as an induced sub graph of a

triangular sum graph.

Proof:

Let G be the cycle with twin chords and e1=v1vk+1 be its chords. We define labeling

f : V (G) N such that the induced function f+ :E(G) {T1,T2,Tq} is bijective.

f(v1) = 0

f(v2) = 6

f(vi) = Ti+2f(vi - 1); 3 1

f(vk) =(1) -1

f(vk+1) =( ) -1
18
f(vk+i) = () -1+if(vk + i -1); 2 1

f(vn) = (1) -1

Now following the procedure adapted in previous theorem the resulting super graph H

admits triangular sum labeling. That is, every cycle with twin chords can be embedded as

an induced sub graph of a triangular sum graph.

Example:

Embedding of C6 with twin chord as an induced sub graph of a triangular sum

graph is shown

19
SOME EXISTING RESULTS: 2.8

This concept was introduced by Hedge and Shankaran and they proved that

Path pn ,starK1 ,n are triangular sum graphs.

ny tree obtained from the star K1 ,n by replacing each edge by a path is a

triangular sum graph

The lobster T obtained by joining the centers of k copies of a stat to a new vertex

w is a triangular sum graph.

The complete n-ary tree Tm of level m is a triangular sum graph.

The complete graph Kn is triangular sum if and only if n 2.

They also shown that

If G is an Eulerian (p ,q)-graph admitting a triangular sum labeling then

q 1(mod 12).

The dutch windmill DW (n) (n copies of K3 sharing a common vertex) is not a

triangular sum graph.

The complete graph K4 can be embedded as an induced sub graph of a triangular

sum graph

20
 CHAPTER III

TRIANGULAR SUMPRIME GRAPHS

In this paper we introduce a new type of labeling known as triangular sum prime graphs.

Graphs which admit a triangular sum prime labeling are called triangular sum prime

graphs. we have proved this result for paths pn, star k1,n.

DEFINITION: 3.1

Let G(V ,E) be a graph with p vertices and q edges.A bijection

f: VE {1,2,p+ is said to be a triangular sum prime labeling.
(i) For each edge e= uv, the labels assigned to u and v are triangular
numbers.
(ii) For each vertex of degree atleast 2, the g.c.d of the labels on the
incident edges is 1.
A graph which admits triangular sum prime numbers is called a
triangular sum prime graph.
Example:

C4 is a triangular sum prime graph.

21
 C3 is a triangular sum prime graph

DEFINITION: 3.2

If the vertices are assigned values subject to certain condition(S) then it is

known as graph labeling.

Any graph labeling will have the following three common characteristic:

(i)A set of numbers from which vertex labels are chosen;

(ii)A rule that assigns a value to each edge;

(iii)A condition that this value has to satisfy.

DEFINITION: 3.3

Let G (V, G) be a graph with p vertices and q edges.

A bijection f: E(G) {1,2, q} is said to be vertex prime labeling if for each vertex of

degree atleast two, the gcd of the labels on its incident edge is 1.

22
DEFINITION: 3.4

A triangular number is a number obtained by adding all positive integers less than
or equal to a given integer n. If the nth triangular number is denoted by An then

An =1/2 [n (n+1)]. The resulting triangular numbers are 1, 3, 6, 10,15,21.

Theorem: 3.5

The path pn is a triangular sum prime graph.

Proof:

Let pn = v1 e1 v2 e2..en -1vn has n vertices and n1 edges..

Define f: VE {1,2,3,.(2n1)} as follows.

f(vi) = 1/2 [i(i+1)]., 1i n

f(ei) = f(ui +1) f(vi), 1i n

clearly f is a bijection . since

(i)for each edge e = uv, the labels assigned to u and v are triangular

numbers.

(ii)for each vertex of degree atleast 2, the g.c.d of the labels on the incident

edges is 1.

According to this pattern, the path pn is a triangular prime graph.

23
Example:

P5 is a triangular sum prime graph

Theorem: 3.6

K1,n where n> 1 is a triangular sum prime graph.

Proof:

Let V (K1) = {n} and vi , 1i n be the vertices adjacent to n.

Therefore K1 ,n has n+1 vertices and n edges.

Define f: VE {1,2,3,.(2n+1)} as follows.

f(u) = 1

f(vi) = 1/2[i(i+1)]., 1i n

f(ei) = f(vi) - f(u), 1i n

clearly f is a bijection

According to this pattern, K1 ,n where n> 1 is a triangular sum prime graph.

24
Example:

K1, 4 is a triangular sum prime graph.

DEFINITION: 3.7

The graph obtained from K1 ,n and K1 ,m by joining their centers

with an edge is called a Bistar.It is denoted by B(n , m).

Theorem: 3.8

Bistar B(n ,m) is not a triangular sum prime graph.

Proof:

Let V(K2) = {u ,v} where ui and vi , 1i n be the vertices adjacent to u and v

respectively.

Number of vertices in B n,m = n+m+2

Number of edges in B n,m = n+m+1

25
 Define f: VE {1,2,3, ,,,,(2n+2m + 3)} as follows

f(u) = o

f(v) =1

f(ui) =1/2[i(i+1)]., 1i n

f(vj) = 1/2[j(j+1)]., 1j n

f(ei) = f(ui) - f(u)

f(ej) = f(vj) - f(v)

According to this pattern B 4 , 3 is not a triangular sum prime graph.

Example:

B 4 , 3 is not a triangular sum prime graph.

In the above graph, we cannot find for each vertex of degree atleast 2, the g.c.d of the

labels on the incident edges is 1.

26
Theorem: 3.9

A graph obtained by adding a single pendent edge to each vertex of a path

pn = v1e1 v2e2..envn is called a comb.

Proof:

Let G be a comb obtained from the path by joining a vertex ui to vi, 1i n

The edges are labeled as follows:

For 1i n ,e2i -1 =viui and e2i = vivi+1

Define f: VE {1,2,3, ,,,,(4n 1) } as follows

Therefore G has ,,2n vertices and ,,2n -1 edges.

Here also the second condition is not satisfied.

Therefore comb is not a triangular sum prime graph.

Example:

27
 CHAPTER -IV

PRIME LABELING IN CONTTEXT OF RING SUM OF GRAPHS

DEFINITION: 4.1

Ring sum of two graphs G1 = (V1, E1) and G2 = (V2, E2) denoted by
G1G2
is the graph.
G1 G 2 = ((V1 V2), ((E1 E2) (E1 E2))).
DEFINITION: 4.2

LetG = (V (G), E (G)) be a graph with p vertices.

A bijection f :v(G) 1,2,.p is called a prime labeling. If for

each edge e =uv, gcd (f(u), f(v)) = 1. A graph which admits prime labeling is called a

prime graph.

MAIN RESULTS:-

THEOREM: 4.3

Cn k1,n is a prime graph for all n N .

Proof:

Let V (G) = V1 V2, where V1 = { u1, u2, ..un}be the , vertex set

of Cn and V2 = { V= u1, v1, v2.vn} be the vertex set of k1,n.

Here v1, v2, vn are pendent vertices. Also |v(G)| = |E(G)| = 2n

We define labeling f: V (G) {1,2,.2n} as follows.

f(ui) = 2i 1; 1i n
28
 f(vj) = 2j ; 1j n

According to this pattern the vertices are labeled such that for any edge

e = uiuj G, gcd (f(ui), f(uj)) = 1

Thus we proved that the graph under consideration admits

Prime labeling.

That is Cn k1,n is a prime graph.

THEOREM: 4.4

G k1,nis a prime graph where G is cycle with twin chord and chords

forms two triangles and one cycle cn-2 for all n N.

Proof:

Let G be the cycle Cn with twin chords. Where chords form two triangles

and one cycle Cn-2.

Let V = V1 V2 ,where v1 is the vertex set of G and V2 be the vertex set

of K1,n and let u1,u2,..un be successive vertices v be the apex vertex of G and e1 = un u2

and e2 = un u3 be the chords of cycle Cn.

Let v1,v2,.vn be the pendent vertices v be the apex vertex of K1,n and

take v = u1.

29
 Also |V(G) | = 2n and |E(G) | = 2n+2.

We define labeling f: V(G) {1,2,.2n} as follows,

f(u1) = 1 , f(u2) = 3 , f(un) = 5

f(ui) = 2i+1 ; 3i n - 1

f(vj) = 2j ; 1j n

According to this pattern the vertices are labeled such that for any edge

e = ui uj u ,

gcd ( f (ui) f(uj) ) = 1

thus we proved that the graph under consideration admits prime labeling.

That is G k1, n is a prime graph where G is the cycle Cn with twin

chord.

THEOREM: 4.5

G k1, nis a prime graph, where G is cycle with triangle and chords
forms triangles and one cycle Cn-5, for all n N.

Proof:

Let G be the cycle with triangle Cn (1, 1, n 5) , Let V = V1 V2

Where V1 is the vertex set of G and V2 be the vertex set of K1 , n.

30
Let u1 ,u3& u5 be the vertices.

e 1 = u1, u5 , e 2 = u3,u5& e 3 = u1,u5

Also | V(G)| =2n & |E(G)| = 2n+3

f (u1) = 1, f (u2) =3 ,f(u3) =5, f(un 1) =7, f(un)= n.

f(ui) =2i+1 ; 4i n 2

f(vj) = 2j ; 1j n

g c d f(ui) f(vj) = 1

Thus we proved that the graph under consideration admits prime labeling.

That G k1, n is a prime graph , where G is the cycle Cn with triangle.

31
 CONCLUSION

The triangular sum labeling plays an important role in graph theory.

In this project we have discussed the varieties of magic labeling for

different kinds of graphs .Also , these concepts can be extended to triangular

sum labeling prime graphs.

32
 BIBLIOGRAPHY

1. J.A. Gallian , A dynamic survey of graph labeling ,The Electronic journal of

combinatories.
2. S.M. Hedge and P. Shankaran, On triangular sum labeling of graphs.
3. Frank Harary ,Graph theory , Narosa publishing House (2001).
4. Fu,H.L and Huage,K.C (1994) on prime labeling Discrete mathematics, North
Holland.
5. A.Tout, A.N Dabbouey and K. Howella, prime labeling of graphs, National
Academy science Letters, 11 (1982).
6. J.A Bondy and U.S.R Murty, Graph theory with applications macmillan,
London, (1976).
7. W.D. Wallis,Magic Graphs, Girkhauser, Basel, 2013.
8. J. Gross and J Yellen, Handbook of Graph theory, CRC press.
9. D M Burton, Elementary Number Theory, Brown publishers, second Edition
(1990).
10. M.Ravi , R.Kala on Total prime Graph.

33