## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

)

Volume 10– No.9, November 2010

1

Edge-odd Gracefulness of C

3

P

n

and C

3

2p

n

Dr. A. Solairaju

Associate Professor of Mathematics

Jamal Mohamed College, Tiruchirapalli – 620 020.

Tamil Nadu, India.

C. Vimala and A.Sasikala

Assistant Professors (SG),

Department of Mathematics,

Periyar Maniammai University, Vallam

Thanjavur – Post.. Tamil Nadu, India.

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 and odd. In this article, the

Edge-odd gracefulness of C

3

P

n

and C

3

2P

n

is

obtained.

Key words: Graceful Graph, Edge-odd graceful labeling,

Edge-odd graceful graph

1. INTRODUCTION

A.Solairaju and K.Chitra [2009] obtained edge-odd

graceful labeling of some graphs related to paths.

A.Solairaju, C.Vimala, A.Sasikala [2008] gracefulness of a

spanning tree of the graph of Cartesian product of S

m

and

S

n

, A. Solairaju et.al. [2010] that the cartesian product of

path P

2

and circuit C

n

for all integer n, S

m, n ,

P

m

S

5

and

C

m

S

n

for n is even, are is edge-odd graceful. Here the edge-

odd graceful labeling of C

3

P

n

and C

3

2P

n

is obtained.

Section 2: Basic Concept

In this section, the following definitions are first listed.

Definition 2.1: Graceful Graph: A function f of a graph G

is called a graceful labeling with m edges, if f is an

injection from the vertex set of G to the set {0, 1,2,

…, m} such that when each edge uv is assigned the label

│f(u) – f(v)│ the resulting edge labels are distinct. Then

the graph G is graceful.

Definition 2.2: Edge – odd graceful graph [6]: A (p, q)

connected graph is edge-odd graceful if there exists an

injective map f: E(G) → {1, 3, …, 2q-1} so that induced

map f

+

: V(G) → {0, 1, 2, …, (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.

Section 3: Edge-odd Gracefulness of

Armed crown graph C

3

P

n

In this section edge-odd gracefulness of C

3

P

n

is

obtained.

Definition 3.1: Armed crown C

3

P

n

is a connected graph

obtained from the circuit C

3

by adding a path P

n

to each

vertex of C

3

. It has 3n vertices and 3n edges. This graph is

given in figure 1.

Figure 1: Graph of C

3

P

n

Lemma 3.2: The connected graph C

3

P

2

is edge – odd

graceful.

The figure 2 is the armed crown C

3

P

2

with 6 vertices and

6 edges, with some arbitrary edge-odd graceful labeling to

vertices and edges.

7

1 5

11 3 9

Figure 2: Graph of C

3

P

2

International Journal of Computer Applications (0975 – 8887)

Volume 10– No.9, November 2010

2

Lemma 3.3: The connected graph C

3

P

3

is edge – odd

graceful.

9

13

1 5

17 3 15

7 11

Figure 3: Graph of C

3

P

3

The graph in figure 3 is the armed crown C

3

P

3

with 9

vertices and 9 edges, with some arbitrary edge-odd graceful

labeling to vertices and edges.

Lemma 3.4: The connected graph C

3

P

4

is edge – odd

graceful.

The armed crown C

3

P

4

with 12 vertices and 12 edges is

given in figure 4 with some arbitrary edge-odd graceful

labeling to vertices and edges.

19

13

7

1 5

11 3 9

17 15

23 21

Figure 4: Graph of C

3

P

4

Theorem 3.5: The connected graph C

3

P

n

is edge – odd

graceful for n > 4.

Proof:

u

n-1

u

2

u

1

l

1

l

3

l

2

t

1

e

1

t

2

e

2

t

n-1

e

n-1

Figure 5: Graph of C

3

P

n

The figure 5 is the armed crown C

3

P

n

with 3n vertices

and 3n edges, with some arbitrary labelings to its vertices

and edges.

Define f: E(G) → {1, 3, …, 2q-1} by

For n is even

f(ℓi) = 2i – 1, i = 1, 2, 3; f(e

1

) = q + 5

f(e

i

) = f(e

1

) + 3i – 3, for i = 3, 5, …, (n-1)

f(e

2

) = 7

f(e

i

) = f(e

2

) + 3i, for i = 4, 6, 8, …, (n-2);

f(t

1

) = f(e

1

) – 2

f(t

i

) = f(t

1

) + 3i – 3, for i = 3, 5, …, (n-1);

f(t

2

) = 11

f(t

i

) = f(t

2

) + 3i, for i = 4, 6, 8, …, (n-2);

f(u

1

) = f(e

1

) – 4

f(u

i

) = f(u

1

) + 3i – 3, for i = 3, 5, …, (n-1); f(u

2

) = 9

f(u

i

) = f(u

2

) + 3i, for i = 4, 6, 8, …, (n-2)

For n is odd

f(ℓi) = 2i – 1, i = 1, 2, 3; f(e

1

) = 11

f(e

i

) = f(e

1

) + 6i – 6, i = 2, 3, …, (n-1) ;

f(t

1

) = 9

f(t

i

) = f(t

1

) + 6i – 6, i = 2, 3, …, (n-1);

f(u

1

) = 7

f(u

i

) = f(u

1

)+6i–6, i = 2, 3 ,…, (n-1) …. (1).

Define f

+

: V(G) → {0, 1, 2, …, (2k-1)} by f

+

(v)

f(uv) mod (2k), where this sum run over all edges through v

…. (2).

Hence the map f and the induced map f

+

provide labels as

distinct odd numbers for edges and also the labeling for

vertex set have distinct values in {1, 2,….,(2k-1)}. Hence

the graph C

3

P

n

is edge-odd graceful.

International Journal of Computer Applications (0975 – 8887)

Volume 10– No.9, November 2010

3

Section 4 - Bi-armed crown C

3

2P

n

is

edge-odd graceful

Definition 4.1: Bi-armed crown C

3

2P

n

is a connected

graph obtained from the circuit C

3

by adding two paths P

n

to each vertex of C

3

. It has (6n - 3) vertices and (6n - 3)

edges.

Figure 6: Graph of C

3

2P

n

Theorem 4.2: The connected graph C

3

2P

n

is edge – odd

graceful.

Proof: The figure 7 is the armed crown C

3

P

n

with (6n -

3) vertices and (6n - 3) edges, with some arbitrary edge-odd

graceful labeling to vertices and edges paths P

n

to each

vertex of C

3

. It has (6n - 3) vertices and (6n - 3) edges.

e

(6n-3)

e

(6n-4)

e

15

e

14

e

9

e

8

e

1

e

2

e

3

e

7

e

4

e

5

e

6

e

13

e

10

e

12

e

10

e

11

e

12

e

(6n-5)

e

(6n-8)

e

(6n-6)

e

(6n-7)

Figure 7: Graph of C

3

2P

n

Define f: E(G) → {1, 3, …, 2q-1} by

For n is even

f(ei) = 2i – 1, i = 1, 2, 3, …, (6n-3). (1)

Define f

+

: V(G) → {0, 1, 2, …, (2k-1)} by

f

+

(v) f(uv) mod (2k), where this sum run over all edges

through v (2)

Hence the map f and the induced map f

+

provide labels as

odd numbers for edges with all distinct and also the

labelings for vertex set has distinct values in {1, 2,…., (2k-

1)}. Hence the graph C

3

2P

n

is edge-odd graceful.

REFERENCES

1. A.Solairaju, A.Sasikala, C.Vimala, Gracefulness

of a spanning tree of the graph of product of P

m

and

C

n

, The Global Journal of Pure and Applied

Mathematics of Mathematical Sciences, Vol. 1, No-2

(July-Dec 2008): pp 133-136

2. A.Solairaju and K.Chitra, Edge-odd graceful

labeling of some graphs “ Electronics Notes in

Discrete Mathematics Volume 33,April 2009, Pages

15 - 20

3. A.Solairaju, C.Vimala, A.Sasikala, Gracefulness

of a spanning tree of the graph of Cartesian product of

S

m

and S

n

, The Global Journal of Pure and Applied

Mathematics of Mathematical Sciences, Vol. 1,

No-2 (July-Dec 2008): pp 117-120

4. A.Solairaju, A.Sasikala, C.Vimala, Edge-odd

Gracefulness of a spanning tree of Cartesian product

of P

2

and C

n

,Pacific-Asian Journal of Mathematics,

Vol .3, No. 1-2. (Jan-Dec. 2009) pp:39-42

5. A.Solairaju, C. Vimala, A. Sasikala, Edge-Odd

Gracefulness of C

m

S

n

for n is even

(communicated to Serial Publications)

- The collaboration network of the Brazilian Symposium on DatabasesAlefe
- 253.pdfsk15021993
- Ioitc 2008 Notesjatinimo1996
- 5. Planar GraphsBhuvana Shankar
- Errata List for Algorithm Manual Skienacoolvar90
- International Journal of Engineering and Science Invention (IJESI)inventionjournals
- GROUP MAGIC LABELING OF CYCLES WITH A COMMON VERTEXIntegrated Intelligent Research
- further mathematics mid year holiday homeworkapi-254501788
- On Harmonious Coloring of M(Y<sub>n</sub>) and C(Y<sub>n</sub>)TI Journals Publishing
- PhysRevA.79.024307 (2)stephanhoyer
- Emmcvpr2007 FinalRai Naidu
- Single Valued Neutrosophic Graphs: Degree, Order and Sizescience2010
- Analysis and Design AlgorithemGuruKPO
- Labeling, Covering and Decomposing of Graphs, Presentation on 18 nov 2009 at Beijing Jiaotong University, P.R.Chinascience2010
- Review Paper-Social Networking With Protecting Sensitive Labels in Data AnonymizationEditor IJRITCC
- Community Detection in Soc MedAni Dalal
- Finding Pattern in Large Graph Database using Mapreduce (Hadoop)IJSTE
- IsoscelesDan Ismailescu
- ShiNitin Tembhurnikar
- Detection of Glaucoma and Hypertension using Artery or Vein ClassificationIJSTE
- James Conant, Rob Schneiderman and Peter Teichner- Milnor Invariants and Twisted Whitney TowersDuncan_Vim
- LECTURE PLAN - M201(EE-I) (2015-16)rroy1045
- Centrality Measures Presentationappleduck123
- Spectral Spars if Ication of GraphsAnonymous txyvmbY
- doc 3api-301349510
- co-lec1Krutarth Patel
- ConceptsOfStressAnalysis2.pdfbalijajagadish
- Part II - Revised DraftSumit Maurya
- 12-Unit12.pdfJohn Arthur
- PhisiologyCarlos Pinedo

- tmp7F8Frontiers
- tmp2EBB.tmpFrontiers
- tmp4359.tmpFrontiers
- A Survey: Hypergraph Partitioning TechniquesInternational Journal for Scientific Research and Development
- tmpD746Frontiers
- tmp20DC.tmpFrontiers
- tmp30E5.tmpFrontiers
- Discrete MathematicsGuruKPO
- tmpC906Frontiers
- A New S-(a,d) Antimagic Labelling of a Class of Generalized Petersen GraphsInternational Journal for Scientific Research and Development
- tmp3C86.tmpFrontiers
- Discrete Mathematics MCQ'SGuruKPO
- Tmp 1387Frontiers
- A NEW S-(a,d) ANTIMAGIC LABELING OF A CLASS OF CIRCULANT GRAPHSInternational Journal for Scientific Research and Development
- Network Bucket TestingFacebook
- tmp18A.tmpFrontiers
- tmpB0E6Frontiers
- tmp3C0A.tmpFrontiers
- Discrete Mathematics MCQ'SGuruKPO
- tmpE648Frontiers
- tmpBF3Frontiers
- tmp6B5B.tmpFrontiers
- tmpDE4.tmpFrontiers
- A Survey on Subgraph Matching Algorithm for Graph DatabaseInternational Journal for Scientific Research and Development
- tmp9F1CFrontiers
- Algorithm and Data StructureGuruKPO
- Analysis and Design AlgorithemGuruKPO
- Context Aware Decision Support Mobile Application for Recommendation in the Domain of HotelsInternational Journal for Scientific Research and Development

- Magoosh TOEFL Vocabulary PDF1br4h1m0v1c
- Integral1br4h1m0v1c
- Dalam Mempelajari Bahasa Inggris1br4h1m0v1c
- 269895442 Linear Regression and Correlation1br4h1m0v1c
- Readme1br4h1m0v1c
- Wilkins - Introduction to Galois Theory - 311.pdf1br4h1m0v1c
- Sword Art Online Side Story1br4h1m0v1c
- Lect_11br4h1m0v1c
- Lect_2.pdf1br4h1m0v1c
- Lascaux Cave Paintings1br4h1m0v1c
- MSc in Pure Mathematics Course Handbook 2015 161br4h1m0v1c
- The.legend.of.Korra.S04E07.Reunion.720p.web DL.2CH.x265.HEVC PSA1br4h1m0v1c
- ErrorCode.txt1br4h1m0v1c
- ---Doraemon Nobita's Great Battle of the Mermaid King 2010 in FullHd With English Subtitle1br4h1m0v1c
- 量产工具版本说明1br4h1m0v1c
- Gadiscilikwww.ac Zzz.tk1br4h1m0v1c
- Matematika (Buku Siswa)1br4h1m0v1c
- 8.1 Tryout Ke-1 - Twk1br4h1m0v1c
- DN.2015.E04.540p Kshowsubindo.net1br4h1m0v1c
- Cover Prosiding Seminar Nasional Matematika VI UNNES1br4h1m0v1c
- Buku Pintar IELTS Vocabulary1br4h1m0v1c
- spmb ipa1br4h1m0v1c
- Trik Internet Gratis Three Aon 10 Agustus 151br4h1m0v1c
- Bleach Hts 71br4h1m0v1c
- Death Note Another Note the Los Angeles BB Murder Cases1br4h1m0v1c
- A10 Matematika Keuangan - 24 Nov 2014 Pagi1br4h1m0v1c
- Formulations for a Problem of Petroleum Transportation1br4h1m0v1c
- Power Series1br4h1m0v1c
- Exam C_11061br4h1m0v1c
- KD11br4h1m0v1c

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading