Add to ORKGIn this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is graceful and the tensor product of the complete bi-partite graph Km, n and a path graph Pk(k> 1) is also graceful
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} ...
In this paper, we present some new families of graceful join of graphs and propose a few unsolved pr...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by join...
This paper presents a pattern of labeling for some special graceful graphs like paths, cycles, compl...
For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km,...
The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelli...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
A graceful labeling of a graph G(p, q) is an injective assignment of labels from the set {0, 1, ...,...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} ...
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} ...
In this paper, we present some new families of graceful join of graphs and propose a few unsolved pr...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by join...
This paper presents a pattern of labeling for some special graceful graphs like paths, cycles, compl...
For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km,...
The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelli...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
A graceful labeling of a graph G(p, q) is an injective assignment of labels from the set {0, 1, ...,...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} ...
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} ...
In this paper, we present some new families of graceful join of graphs and propose a few unsolved pr...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......