3-equitable labeling
1 article · search the full text for this term
-
3-Equitable Labeling in Context of Ring Sum of Graphs
Abstract: A function f from vertex set V of a graph G to the set {0, 1, 2} is called 3-equitable labeling if the edge labels produced by absolute difference of the labels of end vertices of the respective edges in such a way that the number of edges with label i and j differ by atmost 1 and similarly the number of vertices with label i and j differby atmost …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 2, Issue 3, 2015 · pp. 10–19 Read article