Add to ORKGIn this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle Cn with path Pk and two copies of even cycle Cn sharing a common edge are odd graceful graphs. In addition to this we derive that the splitting graph of K1, n as well as the tensor product of K1,n and P2 admits odd graceful labeling
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
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} ...
<p>In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. W...
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We p...
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We p...
Copyright c © 2013 S. Singhun. This is an open access article distributed under the Creative Commons...
A function f is called an odd-even graceful labeling of a graph G if f: V(G) → {0,1,2,…,q} is injec...
In this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is g...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
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} ...
<p>In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. W...
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We p...
In this paper, we introduce the notions of m-shadow graphs and n-splitting graphs,m ≥ 2, n ≥ 1. We p...
Copyright c © 2013 S. Singhun. This is an open access article distributed under the Creative Commons...
A function f is called an odd-even graceful labeling of a graph G if f: V(G) → {0,1,2,…,q} is injec...
In this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is g...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
In this paper, we show that the number of edges for any odd harmonious Eulerian graph is congruent t...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its ...