3-TOTAL SUPER PRODUCT CORDIAL LABELING BY APPLYING UNION OPERATION ON SOME GRAPHS

Full Article - PDF

Published: 2016-03-25

Page: 237-250


ABHA TENGURIA

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

RINKU VERMA *

Department of Mathematics, Medicaps Institute of Science and Technology, Indore, India.

*Author to whom correspondence should be addressed.


Abstract

The product cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total super product cordial labeling. This labeling is discussed by applying union operation on some of the graphs. Here we prove some of the graphs like union of two path graphs, union of path and cycle graph and union of path and complete bipartite graph are 3-Total super product cordial.

Keywords: 3-total product cordial labeling;, 3-total super product cordial labeling;, 3-total product cordial graphs;, 3-total super product cordial graphs.


How to Cite

TENGURIA, A., & VERMA, R. (2016). 3-TOTAL SUPER PRODUCT CORDIAL LABELING BY APPLYING UNION OPERATION ON SOME GRAPHS. Asian Journal of Mathematics and Computer Research, 11(4), 237–250. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/484

Downloads

Download data is not yet available.