|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 65 - Issue 11 |
| Published: March 2013 |
| Authors: E. M. Badr |
10.5120/10965-6017
|
E. M. Badr . Odd Graceful Labeling of the Revised Friendship Graphs. International Journal of Computer Applications. 65, 11 (March 2013), 1-6. DOI=10.5120/10965-6017
@article{ 10.5120/10965-6017,
author = { E. M. Badr },
title = { Odd Graceful Labeling of the Revised Friendship Graphs },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 65 },
number = { 11 },
pages = { 1-6 },
doi = { 10.5120/10965-6017 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A E. M. Badr
%T Odd Graceful Labeling of the Revised Friendship Graphs%T
%J International Journal of Computer Applications
%V 65
%N 11
%P 1-6
%R 10.5120/10965-6017
%I Foundation of Computer Science (FCS), NY, USA
The aim of this paper is to present some odd graceful graphs. In particular we show that the revised friendship graphs F(kC4), F(kC8), F(kC12), F(kC16) and F(kC20) are odd graceful where k is any positive integer. Finally, we introduce a new conjecture " The revised friendship graph F(kCn) is odd graceful where k is any positive integer and n = 0 (mod 4 ).