Ramachandran Varatharaja Perumal

P.S.R. Engineering College · Department of Mathematics

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2, …, q} such that, when each edge xy is assigned the label ∣f (x) − f (y)∣, the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function...

A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function from the vertex set of G to {0, 1,N, (N +1), 2N, (2N +1), · · · ,N(q− 1),N(q − 1)+ 1}in such a way that (i) is 1− 1 (ii) induces a bijection ∗ from the edge set of G to {1,N +1, 2N +1, · · · ,N(q−1)+1}where ∗(uv)=| (u)− (v)|. In this paper we prove...

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set {0,1,2,...,q} such that, when each edge xy is assigned the label |f(x) “ f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function f f...

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2,. . .,q} such that, when each edge xy is assigned the label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function...

In this paper we prove that supersubdivisions of ladders are graceful.

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set (0, 1, 2,..., q) such that, when each edge xy is assigned the label | f(x) — f(y)|, the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function...

In this paper we prove that the arbitrary supersubdivisions of paths, disconnected paths, cycles and stars are one modulo N graceful for all positive integers N.

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a funct...

n this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful.