z-logo
open-access-imgOpen Access
Edge- Odd Gracefulness of Product of P2 and CN
Author(s) -
A. Solairaju,
A. Sasikala,
C. Vimala
Publication year - 2010
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/1523-1680
Subject(s) - computer science , product (mathematics) , enhanced data rates for gsm evolution , information retrieval , mathematics , artificial intelligence , geometry
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 and odd. In this article, the Edgeodd gracefulness of strong product of P2 and Cn is obtained.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom