CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Square Difference 3-Equitable Labeling of Some Graphs

by S. Murugesan, J. Shiama
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 137 - Number 13
Year of Publication: 2016
Authors: S. Murugesan, J. Shiama
10.5120/ijca2016909018

S. Murugesan, J. Shiama . Square Difference 3-Equitable Labeling of Some Graphs. International Journal of Computer Applications. 137, 13 ( March 2016), 1-4. DOI=10.5120/ijca2016909018

@article{ 10.5120/ijca2016909018,
author = { S. Murugesan, J. Shiama },
title = { Square Difference 3-Equitable Labeling of Some Graphs },
journal = { International Journal of Computer Applications },
issue_date = { March 2016 },
volume = { 137 },
number = { 13 },
month = { March },
year = { 2016 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume137/number13/24332-2016909018/ },
doi = { 10.5120/ijca2016909018 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:38:14.037610+05:30
%A S. Murugesan
%A J. Shiama
%T Square Difference 3-Equitable Labeling of Some Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 137
%N 13
%P 1-4
%D 2016
%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|} such that if each edge uv is assigned the label -1 if |[f(u)]2 - [f(v)]2 ≡ -1(mod4), the label 0 if |[f(u)]2 - [f(v)]2|≡0(mod 4) and the label 1 if |[f(u)]2 - [f(v)]2|≡1(mod 4), then the number of edges labeled with i and the number of edges labeled 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 middle graph of paths, fan graphs, (P2n, S1), mK3, triangular snake graphs and friendship graphs.

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.
  7. S. Murugesan, J. Shiama, Square difference 3-equitable labeling of paths and cycles, International Journal of Computer Applications (0975 - 8887) Volume 123 - No.17, August 2015
Index Terms

Computer Science
Information Sciences

Keywords

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

Powered by PhDFocusTM