Add to ORKGWe have investigated some general classes of disconnected graceful graphs. We obtain the graceful labeling for (Pm × Pn
A graceful labeling of a graph G with m edges is a function f: V (G) ! f0; : : : ; mg such that dist...
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, ...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Abstract: In this paper we have proved that union of three grid graphs, and union of finite copies ...
[[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative i...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
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 of size n is an injective assignment of labels from {0,1,... n} to ...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
In this paper we present graceful labelings for C(t ·Pn ×Pm), (Pn ×Pm)? and path union of t copies o...
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...
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci grac...
Abstract. A labeled graph G which can be gracefully numbered is said to be graceful. Labeling the no...
A graceful labeling of a graph G with m edges is a function f: V (G) ! f0; : : : ; mg such that dist...
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, ...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...
Abstract: In this paper we have proved that union of three grid graphs, and union of finite copies ...
[[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative i...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
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 of size n is an injective assignment of labels from {0,1,... n} to ...
A graph of size n is said to be graceful when is possible to assign distinct integers from {0, 1,......
In this paper we present graceful labelings for C(t ·Pn ×Pm), (Pn ×Pm)? and path union of t copies o...
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...
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci grac...
Abstract. A labeled graph G which can be gracefully numbered is said to be graceful. Labeling the no...
A graceful labeling of a graph G with m edges is a function f: V (G) ! f0; : : : ; mg such that dist...
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, ...
A simple graph is said to be a vertex -graceful if there exists a vertex graceful labeling on the ...