|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 123 - Issue 17 |
| Published: August 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 },
year = { 2015 },
volume = { 123 },
number = { 17 },
pages = { 1-5 },
doi = { 10.5120/ijca2015905774 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A S. Murugesan
%A J. Shiama
%T Square Difference 3-Equitable Labeling of Paths and Cycles%T
%J International Journal of Computer Applications
%V 123
%N 17
%P 1-5
%R 10.5120/ijca2015905774
%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 | } 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.