Research Article

Article:Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

by  A.Solairaju, C. Vimala Ands A.Sasikala
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Issue 10
Published: November 2010
Authors: A.Solairaju, C. Vimala Ands A.Sasikala
10.5120/1522-1679
PDF

A.Solairaju, C. Vimala Ands A.Sasikala . Article:Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4. International Journal of Computer Applications. 10, 10 (November 2010), 4-6. DOI=10.5120/1522-1679

                        @article{ 10.5120/1522-1679,
                        author  = { A.Solairaju,C. Vimala Ands A.Sasikala },
                        title   = { Article:Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4 },
                        journal = { International Journal of Computer Applications },
                        year    = { 2010 },
                        volume  = { 10 },
                        number  = { 10 },
                        pages   = { 4-6 },
                        doi     = { 10.5120/1522-1679 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2010
                        %A A.Solairaju
                        %A C. Vimala Ands A.Sasikala
                        %T Article:Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4%T 
                        %J International Journal of Computer Applications
                        %V 10
                        %N 10
                        %P 4-6
                        %R 10.5120/1522-1679
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, …, 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, …, (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct

References
  • A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics Notes in Discrete Mathematics Volume 33,April 2009, Pages 15 – 20
  • A.Solairaju, A.Sasikala, C.Vimala Edge-odd Gracefulness of a spanning tree of Cartesian product of P2 and Cn ,Pacific-Asian Journal of Mathematics, Vol .3, No.1-2. (Jan-Dec.2009) pp:39-42.
  • A.Solairaju, A.Sasikala, C.Vimala Edge-odd Gracefulness of strong product of C3 and Cn, communicated to serials publications, New Dehli.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Generalised n-squares Graceful Graphs Edge-odd graceful labeling Edge-odd Graceful Graph

Powered by PhDFocusTM