We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

On Prime Labeling of some Classes of Graphs

by N. Ramya, K. Rangarajan, R. Sattanathan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 4
Year of Publication: 2012
Authors: N. Ramya, K. Rangarajan, R. Sattanathan
10.5120/6248-8320

N. Ramya, K. Rangarajan, R. Sattanathan . On Prime Labeling of some Classes of Graphs. International Journal of Computer Applications. 44, 4 ( April 2012), 1-3. DOI=10.5120/6248-8320

@article{ 10.5120/6248-8320,
author = { N. Ramya, K. Rangarajan, R. Sattanathan },
title = { On Prime Labeling of some Classes of Graphs },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 4 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number4/6248-8320/ },
doi = { 10.5120/6248-8320 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:34:38.921844+05:30
%A N. Ramya
%A K. Rangarajan
%A R. Sattanathan
%T On Prime Labeling of some Classes of Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 4
%P 1-3
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Graph labeling is an important area of research in Graph theory. There are many kinds of graph labeling such as Graceful labeling, Magic labeling, Prime labeling, and other different labeling techniques. In this paper the Prime labeling of certain classes of graphs are discussed. It is of interest to note that H-graph which is a 3 –regular graph satisfy Prime labeling. A Gear graph is a graph obtained from Wheel graph, with a vertex added between each pair of adjacent vertices of an outer cycle. It is proved in general this graph is Prime. Yet another class of graphs is the Sun flower graph and corona of Cycle graph Cn and K1,3 . A stepwise algorithm is given to prove that both these classes of graphs satisfy Prime labeling.

References
  1. Gallian, J. A. 2009. A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, (Jan 31, 2009).
  2. Vasanthi, B. Sattanathan, R. 2011. Graceful labeling of Sun flower graphs, Proc. Int. Conf. Math. Comp. Sci. , 533?536.
  3. Lee, S. M. Wue, I. and Yeh, J. (1988). On the amalgamation of prime graphs, Bull Malaysian Math. Soc. , (2)11, 59?67.
  4. Annamma, V. (2010). Total vertex irregularity strength of H Graph and Gear graph, Proc. Int. Conf. Math. Comp. Sci. , 237?239.
  5. Ramya, N. Rangarajan, K. and Sattanathan, R. (2011). On coloring of Bimagic 4-regular grphs, Int. Journal of Ultra Scientist of Physical Sciences, 23(3).
  6. Ramya, N. Rangarajan, K. and Sattanathan, R. 4-regular graphs and its Prime labeling, IJCGTA, accepted for publication.
  7. Ramya, N. Rangarajan, K. and Sattanathan, R. (2012). Edge magic labeling of Some graphs, Proc. Nat. Conf. (NCMTA-2012), 258?262.
  8. Ramya, N. Rangarajan, K. and Sattanathan, R. (2012), Edge magic and Anti magic labeling of Regular graphs, Proc. of ICMEB-2012.
  9. Seoud. M. A,Youssef. M. S, Harmonious labeling of helms and related graphs,unpublished.
  10. Indra Rajasingh, BharatiRajan and Helda Mercy,Exact Wirelength of H Graphs on Path, Mathematics and Computer Science(2009).
Index Terms

Computer Science
Information Sciences

Keywords

Prime Labeling H-graph Gear Graph Sunflower Graph Corona Of Cn And K1 3