Some Simple Algorithms for Some Odd Graceful Labeling Graphs

Moussa M. I.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Russia, 20 - 22 August 2009, pp.399-401 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Moscow
  • Country: Russia
  • Page Numbers: pp.399-401


The spider graph obtained by identifying the end points of m internally disjoint paths each of length n denoted P-n,P-m, and the graph obtained by identifying the other end points of the graph P-n;m called the closed spider graph denoted C-n;m. This paper describes the algorithms to show that the following graphs; P2r + 1; m, 1 <= r <= 5 and m >= 2, the graphs obtained by joining one or two paths P-m to each vertex of the path P-n, the graphs obtained by adding two paths each of length m to each vertex of the path p(n), the closed spider graphs, and the tenser product of a two path graphs P-n boolean AND P-m are odd graceful.