|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 137 - Issue 13 |
| Published: March 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 },
year = { 2016 },
volume = { 137 },
number = { 13 },
pages = { 1-4 },
doi = { 10.5120/ijca2016909018 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A S. Murugesan
%A J. Shiama
%T Square Difference 3-Equitable Labeling of Some Graphs%T
%J International Journal of Computer Applications
%V 137
%N 13
%P 1-4
%R 10.5120/ijca2016909018
%I Foundation of Computer Science (FCS), NY, USA
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.