Asha Rani, A (2025) STRONGSUMANDPRODUCTCORDIALLABELINGOF SUBDIVISION OFTREERELATEDGRAPHS. STRONGSUMANDPRODUCTCORDIALLABELINGOF SUBDIVISION OFTREERELATEDGRAPHS, 14 (2). pp. 338-344.

[thumbnail of STRONG SUM AND PRODUCT CORDIAL LABELING OF SUBDIVISION OF TREE RELATED GRAPHS.pdf] Text
STRONG SUM AND PRODUCT CORDIAL LABELING OF SUBDIVISION OF TREE RELATED GRAPHS.pdf - Published Version
Download (233kB)

Abstract

A graph G(V,E) is said be strong sum and product cordial labeling if there exists
an injective function f from the vertex set V (G) to the set of positive real numbers so that
the induced edge function f∗ from the edge set E(G) defined by f∗(uv) = f(u) + f(v) =
f(u) ×f(v) takes the value 1 if it satisfies or 0 otherwise. Also satisfies the cordiality condition
that |(ef∗(0) − ef∗(1)| ≤ 1. We are going to investigate this labeling for certain classes of
subdivision of tree related graphs in this paper.

Item Type: Article
Uncontrolled Keywords: Graph, strong sum and product cordial labeling, strong sum and product cordial graphs.
Divisions: PSG College of Arts and Science > Department of Mathematics
Depositing User: Dr. B Sivakumar
Date Deposited: 12 Dec 2025 06:06
Last Modified: 12 Dec 2025 06:06
URI: https://ir.psgcas.ac.in/id/eprint/2587

Actions (login required)

View Item
View Item