CFP last date
20 January 2025
Reseach Article

Square Difference 3-Equitable Labeling of Paths and Cycles

by S. Murugesan, J. Shiama
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 123 - Number 17
Year of Publication: 2015
Authors: S. Murugesan, J. Shiama
10.5120/ijca2015905774

S. Murugesan, J. Shiama . Square Difference 3-Equitable Labeling of Paths and Cycles. International Journal of Computer Applications. 123, 17 ( August 2015), 1-5. DOI=10.5120/ijca2015905774

@article{ 10.5120/ijca2015905774,
author = { S. Murugesan, J. Shiama },
title = { Square Difference 3-Equitable Labeling of Paths and Cycles },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 123 },
number = { 17 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume123/number17/22048-2015905774/ },
doi = { 10.5120/ijca2015905774 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:12:55.897649+05:30
%A S. Murugesan
%A J. Shiama
%T Square Difference 3-Equitable Labeling of Paths and Cycles
%J International Journal of Computer Applications
%@ 0975-8887
%V 123
%N 17
%P 1-5
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,…. | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 - [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 - [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 - [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by atmost 1 for -1 = I, j = 1. If a graph has a square difference 3-equitable labeling, then it is called square difference 3-equitable graph. In this paper, we investigate the square difference 3-equitable labeling behaviour of paths and cycles.

References
  1. F. Harary, Graph Theory, Addition-Wesley, Reading, Mass, 1972.
  2. J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics, 17 (2010), DS6.
  3. J.Shiama, Square sum labeling for some middle and total graphs, International Journal of Computer Applications (0975-8887) Volume 37- No.4 January 2012.
  4. J.Shiama, Square difference labeling for some graphs, International Journal of Computer Applications (0975-8887) Volume 44- No.4, April 2012.
  5. J.Shiama, Some Special types of Square difference graphs, International Journal of Mathematical archives- 3(6), 2012, 2369-2374 ISSN 2229-5046.
  6. J.Shiama, Square difference labeling for some path, fan and gear graphs, International Journal of Scientific and Engineering Research volume 4, issues 3, March -2013, ISSN 2229- 5518.
Index Terms

Computer Science
Information Sciences

Keywords

Square difference 3-equitable labeling square difference 3-equitable graphs