A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Square Difference 3-Equitable Labeling of Paths and Cycles
2015
International Journal of Computer Applications
Preserved Fulltext
A square difference 3-equitable labeling of a graph G with ver- , 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 paths and cycles.
doi:10.5120/ijca2015905774
fatcat:4gbr377oqndi7gnzhejtagtqxm