Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs. In particular we show an odd graceful labeling of the linear 4 1 kC snake mK − e and therefore we introduce the odd graceful labeling of 4 1 kC snake mK − e ( for the general case ). We prove that the subdivision of linear 3 kC snake − is odd graceful. We also prove that the subdivision of linear 3 kC snake − with m-pendant edges is odd graceful. Finally, we present an odd graceful labeling of the crown graph P mK n 1 e
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...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
www.bu.edu.eg The objective of this paper is to present a new class of odd graceful graphs. In parti...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
<p>In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ...
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd grac...
In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1...
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd grac...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
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...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one...
www.bu.edu.eg The objective of this paper is to present a new class of odd graceful graphs. In parti...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireles...
<p>In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ...
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd grac...
In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1...
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd grac...
In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and n −1edge is odd graceful, a...
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...
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to ...