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

TENGURIA, ABHA and VERMA, RINKU (2016) 3-TOTAL SUPER PRODUCT CORDIAL LABELING BY APPLYING UNION OPERATION ON SOME GRAPHS. Asian Journal of Mathematics and Computer Research, 11 (4). pp. 237-250.

Full text not available from this repository.

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.

Item Type: Article
Subjects: Universal Eprints > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 08 Jan 2024 13:26
Last Modified: 08 Jan 2024 13:26
URI: http://journal.article2publish.com/id/eprint/3406

Actions (login required)

View Item
View Item