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
Reseach Article

Square Difference Labeling for Some Graphs

by J. Shiama
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 4
Year of Publication: 2012
Authors: J. Shiama
10.5120/6253-8399

J. Shiama . Square Difference Labeling for Some Graphs. International Journal of Computer Applications. 44, 4 ( April 2012), 30-33. DOI=10.5120/6253-8399

@article{ 10.5120/6253-8399,
author = { J. Shiama },
title = { Square Difference Labeling for Some Graphs },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 4 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 30-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number4/6253-8399/ },
doi = { 10.5120/6253-8399 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:34:42.103999+05:30
%A J. Shiama
%T Square Difference Labeling for Some Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 4
%P 30-33
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Here I define a new labeling and a new graph called square difference labeling and the square difference graph. Let G be a (p, q) graph. G is said to be a square difference graph if there exists a bijection f: V(G) ?{ 0,1, …. , p-1} such that the induced function f* : E(G) ? N given by f*(uv) = | [f(u)]2 - [f(v)]2| for every uv ? E(G) are all distinct. A graph which admits square difference labeling is called square difference graph. In this paper I discussed the square difference labeling is admitted for some graphs like cycles, complete graphs, cycle cactus, ladder, lattice grids, wheels, quadrilateral snakes, the graph G = K2 + m K1.

References
  1. V. Ajitha, S. Arumugam and K. A. Germina "On Square sum graphs" AKCE J. Graphs, Combin, 6(2006) 1- 10
  2. L. Beineke and S. M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph theory, 21(2001), 63- 75.
  3. Frank Harrary, Graph theory, Narosa Publishing House- (2001).
  4. J A Gallian, A dynamic survey of graph labeling, The Electronics journal of Combinatories, 17(2010) # DS6
  5. Gary Chartrnd, Ping Zhang, Introduction to Graph theory, McGraw- Hill International Edition
  6. J. Shiama" Square sum labeling for some middle and total graphs" International Journal of Computer Applications (0975-08887) Volume 37- No. 4 January 2012
  7. J. Shiama "Permutation labeling for some shadow graphs" International Journal of Computer Application (0975- 8887) Volume 40- No. 6 February 2012
  8. J. Shiama "Permutation labeling for some splitting graphs" Proceedings of the National Conference on Mathematical Modeling and Simulation. NCMS'12 11th Feb. 2012 , by Vinayaka missions.
  9. D B West, Introduction to Graph Theory, Prentice-Hall, India, 2001
Index Terms

Computer Science
Information Sciences

Keywords

Square Difference Labeling Square Difference Graph Cycle Cactus