ON 3-TOTAL EDGE SUM CORDIAL LABELING OF UNION OF GRAPHS

Purchase PDF

Published: 2016-12-06

Page: 231-240


ABHA TENGURIA

Department of Mathematics, Govt. MLB P.G. Girls Autonomus College, Bhopal, India

RINKU VERMA *

Department of Mathematics, Medicaps University, Indore, India

*Author to whom correspondence should be addressed.


Abstract

In this paper, we have discussed 3-Total edge sum cordial labeling of graphs. This labeling is investigated by applying union operation on some of the graphs. We investigate union of cycle and complete bipartite graph, union of two cycles and union of two complete bipartite graph on this concept.

Keywords: Cordial labeling, edge sum cordial labeling, 3-Total edge sum cordial labeling, 3-Total edge sum cordial graphs


How to Cite

TENGURIA, A., & VERMA, R. (2016). ON 3-TOTAL EDGE SUM CORDIAL LABELING OF UNION OF GRAPHS. Asian Journal of Mathematics and Computer Research, 14(3), 231–240. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/720

Downloads

Download data is not yet available.