CFP last date
21 October 2024
Reseach Article

Odd - Even Graceful Labeling for Different Paths using Padavon Sequence

by S. Uma Maheswari
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Number 10
Year of Publication: 2014
Authors: S. Uma Maheswari
10.5120/15668-4090

S. Uma Maheswari . Odd - Even Graceful Labeling for Different Paths using Padavon Sequence. International Journal of Computer Applications. 89, 10 ( March 2014), 20-23. DOI=10.5120/15668-4090

@article{ 10.5120/15668-4090,
author = { S. Uma Maheswari },
title = { Odd - Even Graceful Labeling for Different Paths using Padavon Sequence },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 89 },
number = { 10 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 20-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume89/number10/15668-4090/ },
doi = { 10.5120/15668-4090 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:08:53.247563+05:30
%A S. Uma Maheswari
%T Odd - Even Graceful Labeling for Different Paths using Padavon Sequence
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 10
%P 20-23
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A function f is called an odd-even graceful labeling of a graph G if f: V(G) ? {0,1,2,…,q} is injective and the induced function f* : E(G) ? { { 0,2,4,…,2q+2i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {2,4,6,…,2q}. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, the odd-even gracefulness of paths p1, p2, p3,…, p11 ¬is obtained.

References
  1. L. W. Beinke and S. M. Hegde, Strong multiplicative graphs, Discuss. Math. Graph Theory, 21(2001), 63-75
  2. R. B. Gnanajothi, Topics in Graph Theory, Ph. D. Thesis, Madurai Kamaraj University, 1991
  3. G. J. Gallian, A dynamic survey of graph labeling, The electronic journal of combinatorics, a. 16 (2009), #DS6.
  4. S. W. Golomb, How to number a graph in graph theory and computing, R. C. Read, ed. , a. Academic Press, New York (1972), 23-37. b. 5. J. Gross and J. Yellen , Graph theory and its applications, CRC Press, (1999)
  5. 6. A. Rosa, On certain valuations of the vertices of a
  6. graph, Theory of graphs (International a. Symposium, Rome), July (1966).
  7. S. Uma Maheswari, Graceful Labeling of the paths using padavon sequence, International Journal of Mathematical Archive-4(4), 013, 66-71.
  8. S. Uma Maheswari, Edge Odd graceful labeling of the paths using padavon sequence, International Journal of computer applications.
Index Terms

Computer Science
Information Sciences

Keywords

Padavon sequence vertex labeling edge labeling graceful labeling odd-even graceful labeling