Research Article

Graceful Labeling of Graphs Related to Circuits of Length 4

by  A. Solairaju, S. Malathi
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Issue 1
Published: November 2014
Authors: A. Solairaju, S. Malathi
10.5120/18343-9459
PDF

A. Solairaju, S. Malathi . Graceful Labeling of Graphs Related to Circuits of Length 4. International Journal of Computer Applications. 105, 1 (November 2014), 29-32. DOI=10.5120/18343-9459

                        @article{ 10.5120/18343-9459,
                        author  = { A. Solairaju,S. Malathi },
                        title   = { Graceful Labeling of Graphs Related to Circuits of Length 4 },
                        journal = { International Journal of Computer Applications },
                        year    = { 2014 },
                        volume  = { 105 },
                        number  = { 1 },
                        pages   = { 29-32 },
                        doi     = { 10.5120/18343-9459 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2014
                        %A A. Solairaju
                        %A S. Malathi
                        %T Graceful Labeling of Graphs Related to Circuits of Length 4%T 
                        %J International Journal of Computer Applications
                        %V 105
                        %N 1
                        %P 29-32
                        %R 10.5120/18343-9459
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

The aim of the paper is to find graceful labeling for the graphs nC4, nC4 o 2Pn, nP2 ? P2n, its mirror image, nC4 ? 2P2n ? (n-1)P2, and nC4 ? 2P2n ? (n-1)P2 ? (n-1)P3.

References
  • A. Solairaju, and K. Chithra, New classes of graceful graphs by merging a finite number of C4, Acta Ciencia Indica, Vol. XXXIV M, N0. 2, (2008a), 959-965
  • A. Solairaju, and K. Chithra, Edge-odd graceful labeling of the complete bipartite graph, The Global Journal of Applied Mathematics & Mathematical Sciences,Volume 1, No. 2, (2008b), 137-141.
  • A. Solairaju and K. Chitra, Edge-odd graceful labeling of some graphs " Electronics Notes in Discrete Mathematics, Volume 33, (April 2009), 15-20
  • A. Solairaju, A. Sasikala, C. Vimala, Gracefulness of a spanning tree of the graph of product of Pm and Cn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008a), 133-136
  • A. Solairaju, C. Vimala, A. Sasikala Gracefulness of a spanning tree of the graph of Cartesian product of Sm and Sn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No. 2 (July-Dec 2008b), 117-120
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Graceful graphs edge-odd graceful labeling and edge-odd graceful graph

Powered by PhDFocusTM