Scribd
Upload
28 views22 pages

Thomas 7796

The document discusses square graceful labeling of graphs. It defines basic graph theory concepts and discusses square graceful labeling of specific graph types like bistar, crown, comb, kite, caterpillar graphs and some standard graphs. It includes definitions, theorems and examples related to determining if a graph allows for a square graceful labeling.

Uploaded by

vasanthi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views22 pages

Thomas 7796

The document discusses square graceful labeling of graphs. It defines basic graph theory concepts and discusses square graceful labeling of specific graph types like bistar, crown, comb, kite, caterpillar graphs and some standard graphs. It includes definitions, theorems and examples related to determining if a graph allows for a square graceful labeling.

Uploaded by

vasanthi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

WELCOME

SQUARE GRACEFUL LABELING


OF GRAPH
NAME

THOMAS AJITH KUMAR J


DEPARTMENT NO

18PMA816
Under the guidance of
Prof. J. Mercy Arokia Rani,M.Sc.,M.phil.,B.Ed.,PGDCSA.,SET

Assistant Professor,
Department of Mathematics
St. Joseph’s College (Autonomous)
Tiruchirappalli – 620 002
INTRODUCTION

 Graph Theory is one of the most important and efficient branch in


Mathematics. It does not require advanced mathematical tools but
some-times deep consideration. For this reason graph theory is an
excellent research field for young people interested in mathematics.
Graph theory studies the properties of various graphs. Graphs can be
used to model many situations in the real world. These are applications
of graph theory to some areas Physics, Chemistry, Computer science
and Economics. The theory is intimately related to many branch of
mathematics including Graph theory, Matrix theory Numerical Analysis
and combinatorics .

 The paper written by Leohard Euler on the seven Bridges of Konigberg


published in 1736 is regarded as the first paper in the history of graph
theory. More than one century after Euler’spaper on the bridges of
konigberg and while listing introduced topology Cayley was lead by
the study of particular class of graphs the trees .
 .
Graph theory is one of the most important and efficient branch in
Mathematics. The study of graceful Graphs and graceful labeling
method was introduced by Rosa. Rose defined a β -valuation of a
graph G with edges as an injection from the vertices of G to the
set {0,1,2,…..e} such that when each edge xy is assigned the labels
|f(x)-f(y)| the resulting edge labels are distinct.

 The graceful labeling problem is determine which graphs are graceful.


Proving a graph G is or is not graceful involves either producing a graceful
labeling of G showing that no such labeling exists.
.

CHAPTER 1

BASIC DEFINITIONS WITH EXAMPLES


Definition
A graph G(V,E) consists of a non-empty set of object V=(v1,v2,...,vn)
called vertices and another set E =(e1,e2,...,en)whose elements are
called edges, such that each edge ek is identified with an unordered pair
(vi,vj) of vertices.

EXAMPLE

let G = (V,E) graph, where V = {v1,v2,v3,v4,v5} and


E={e1,e2,e3,e4,e5,e6,e7}.

v1 e1 v2
e2
. e5 e6
e7 v3

e3
v5 e4 v4

G
Definition
A graph H=(V1,E1) is called a subgraph of G=(V,E), if V1 ⊆ V and E1 ⊆ E.

Example
H is a subgraph of G. Since V (H) ⊆ V (G) and E(H) ⊆ E(G).

v2 e2 v3 v1 e1 v2
e1 e3
v1 e4 e6 v4 e5
e4 e2
e5
e7 e9
v6 e8 e3
v5 v4 v3

G H
Definition
A graph in which all vertices are of equal degree is called a regular graph.
That is ∆(G) = δ(G)
Note
The complete graph Kp is regular of degree p − 1.

Example
G is a regular of degree 3.

Definition
A graph G in which any two distinct points are adjacent is called a
complete graph. The complete graph with p vertices is denoted by Kp
Example
Graph G is said to be complete and it is denoted by K4.
v1

v4
v2 v3
Definition
The Diameter d(G) of G is defined as:
d(G) = Max{eccG(v);v ∈ V (G)}.

For a vertex v in a connected non trivial graph G. The eccentricity eccG(v) of a


vertex v is the greatest geodesic distance between v and any other vertex

Definition
A complete bipartite graph K1,n is called a star and it has n+1 vertices
and n edge.
CHAPTER 2
SQUARE GRACEFUL GRAPH OF BISTAR
Definition
The bistar graph Bm,n is the graph obtained from a copy of star K1,m and a
copy of star K1,n by joining the vertices of maximum by an edge

Theorem
The star K1,n is square graceful for all n.
Theorem
Every bistar Bm,n is a square graceful graph.
Theorem

The graph obtained by the subdivision of the edges of the star K1,n
is a square graceful graph.
Example
A square graceful labeling of star K1,12

A square graceful labeling of starK1,12.


CHAPTER 3
SQUARE GRACEFUL GRAPH OF CROWN AND COMB
Definition
Crown graph on 2n vertices is and with two sets undirected graphs of
vertices {u1,u2,….,un} and {v1,v2,….,vn} and with an edge from ui to vj
whenever i≠j.

The crown graph can be viewed as a complete bipartite graph.


Definition
The graph PnAK1,m vertex of Pm is obtained by attaching K1,m to
each vertex of Pn,…
Combo is a graph obtained by joining a single pendent edge to each
vertex of a path
Theorem
The generalized crown C3ΘK1,n is a square graceful graph.
Example
A square graceful labeling of C3ΘK1,4

A square graceful labeling of C3ʘK1,4


Theorem
The comb PnΘK1 is a square graceful graph.

Example
A square graceful labeling of P7ΘK1

A square graceful labeling of P7ΘK1


CHAPTER 4
.
SQUARE GRACEFUL GRAPH OF KITE AND CATER PILLAR GRAPH

Definition
An kite graph, consist of a cycle of length n with a t – edge path (the tail)
attached to one vertex.
Theorem
(3,t) kite graph is square graceful for t ≥ 2

Example
A square graceful labeling of (3,3) kite

A square graceful labeling of (3,3) kite


Definition
Let Xi Ɛ N. Then the cater pillar S(X1,X2,….Xn) is obtained from
the path Pn by joining Xi vertices to each of the ith vertex of
Pn(1 ≤ i ≤ n)

Theorem
The caterpillar S(X1,X2,….Xn) is square graceful for all n > 1
Theorem
Every path Pn is a square graceful graph
CHAPTER 5

SQUARE GRACEFUL GRAPH OF SOME STANDARD GRAPH


Definition
The graph Pn-1(1,2,3,…,n) is a graph obtained from a path of vertices
v1,v2,…vn having the path length n-1 by joining i pendant vertices at
each of its vertices.
Theorem
The graph PnΘ K1 - e is square graceful for all n >1
Theorem
Let Pn be the path on n vertices. Then the twice graph G obtained
from the path Pn by attaching exactly two pendent edges to each
internal vertex of the Path is square graceful.
Theorem
Let G be the graph obtained by identifying the pendent vertices
of K1,m by K1,n. Then G is square graceful for all m,n ≥ 1.

Definition
The coconut tree graph is obtained by identifying the central vertex
of K1,n with a pendent vertex of the path Pm.
Theorem
The coconut tree graph is square graceful for all n ≥ 1 and
m ≥ 1.
CONCLUSION
Graceful and square graceful graphs is one of the interesting
topic in graph theory.In this project we have found some different
types of graceful graphs like bistar, Crown, comb,kite, caterpillar
and some standard graph.
REFERENCE

[1] B.D. Acharaya construction of certain infinite families of graceful graphs from
A given graceful graph, Definition. Sci.j., 32(3) (1982),231-236.

[2] G.S. Bloom, S.W. Golomb Applications of numbere undirected graphs


proceeding of IEEE, 65(4)(1977), 562-570.

[3] A. Rosa, on certain valuations of the vertices of a graph, theory of graphs,


International Symposium, Rome, July(1966), Gordon And Breah, New York
Andunod paris (1967), 349 – 355.

[4] Graph Theory With Applications, J. A. Bondy, U.S.R Murty, Macmilan


Press Ltd,1976.

[5] Invitation To Graph Theory, S. Arumugam S.Ramachandran, Scitech


Publications(India) Prt Ltd, Chennai,2001.SSS
THANK YOU

You might also like