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 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Some Polygonal Sum Labeling of Paths

by S. Murugesan, D. Jayaraman, J. Shiama
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 5
Year of Publication: 2013
Authors: S. Murugesan, D. Jayaraman, J. Shiama
10.5120/10078-4692

S. Murugesan, D. Jayaraman, J. Shiama . Some Polygonal Sum Labeling of Paths. International Journal of Computer Applications. 62, 5 ( January 2013), 30-34. DOI=10.5120/10078-4692

@article{ 10.5120/10078-4692,
author = { S. Murugesan, D. Jayaraman, J. Shiama },
title = { Some Polygonal Sum Labeling of Paths },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 5 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 30-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number5/10078-4692/ },
doi = { 10.5120/10078-4692 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:10:54.650954+05:30
%A S. Murugesan
%A D. Jayaraman
%A J. Shiama
%T Some Polygonal Sum Labeling of Paths
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 5
%P 30-34
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A (p,q) graph G is said to admit a polygonal sum labeling if its vertices can be labeled by non -negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q polygonal numbers. A graph G which admits a polygonal sum labeling is called a polygonal sum graph. In this paper we prove that the paths admit pentagonal, hexagonal, heptagonal, octagonal, nonagonal and decagonal sum labeling. This work is a nice composition of graph theory and combinatorial number theory.

References
  1. Frank Harary, Graph theory, Narosa Publishing House- (2001).
  2. D. M. Burton, Elementary number theory, Brown publishers, Second edition(1990)
  3. J A Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatorics, 17(2010) # DS6
  4. S. K. Vaidya, U. M. Prajapatti and P. L. Vihol, some Important Results on Triangular sum graphs, Applied Mathematical Sciences, Vol. 3,2009,no. 36,1763-1772
Index Terms

Computer Science
Information Sciences

Keywords

Polygonal Sum

Powered by PhDFocusTM