### 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 1, {0<= i, j <= 2, i is not equal to j. A graph which admits 3-equitable labeling is called 3-equitable graph. Inthis paper we have derived 3-equitable labeling of ringsum of different graphs.

#### Keywords

#### Full Text:

PDF#### References

(1) J. A. Gallian, ”A dynamic survey of graph labeling”, The Electronics Journal of Combinatorics, 16(2013),

]DS6 1 - 308.

(2) J. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 1999.

(3) I. Cahit, On Cordial and 3-equitable labelings of Graphs, Util. Math., 37(1990)189 - 198.

(4) G. V. Ghodasara, S. G. Sonchhatra, Further Results on 3-equitable Labeling,IAENG International Journal of

Applied Mathematics,4(1)2015, 1 - 15.

(5) M. V. Bapat and N. B. Limaye, Some families of 3-equitable graphs, J. Combin. Math. Combin. Comput.,

(2004)179 - 196.

(6) M. Z. Youssef, A necessary condition on k-equitable labelings, Util. Math., 64(2003)193 - 195.

(7) S. K. Vaidya, N. A. Dani, K. K. Kanani, and P. L. Vihol, Cordial and 3-Equitable Labeling for Some Shell

Related Graphs, 438 - 449(2009)

### Refbacks

- There are currently no refbacks.

**This site has been shifted to https://stmcomputers.stmjournals.com/**