You are in:Home/Publications/ E. M. Badr (2013): Odd Graceful Labeling of the revised friendship graphs, International Journal of Computer Applications, Vol.65, No.11, pp. 1-6.

Prof. Alsayed alsayed mitwali badr :: Publications:

Title:
 E. M. Badr (2013): Odd Graceful Labeling of the revised friendship graphs, International Journal of Computer Applications, Vol.65, No.11, pp. 1-6.
Authors: E. M. Badr
Year: 2013
Keywords: Not Available
Journal: Not Available
Volume: Not Available
Issue: Not Available
Pages: Not Available
Publisher: Not Available
Local/International: International
Paper Link:
Full paper Alsayed alsayed mitwali badr_pxc3886017.pdf
Supplementary materials Not Available
Abstract:

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 ) .

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus