On Certain Types of Product Set-Labeling of Graphs

Abstract : The product set of two sets A and B of integers, denoted by A * B, is the set A * B = {ab : a ∈ A, b ∈ B}. For X ⊆ N, a product set-labeling (PS-labeling) of a graph G is an injective function ƒ : V (G) → P(X) such that the induced function f* : V (G) → P(X) is defined as ƒ*(uv) = ƒ(u) * ƒ(v)≤ uv ∈ E(G), ƒ(u) * ƒ(v) being the product set of ƒ(u) and ƒ(v). The PS-labeling of a graph can be classified into certain types in two ways: in accordance with the cardinalities of the set-labels and according to the nature of the collection of set-labels of elements of the graph G. This paper discusses different types of PS-labeling of graphs.
Document type :
Journal articles
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

Contributor : Sudev Naduvath <>
Submitted on : Monday, August 5, 2019 - 4:09:31 PM
Last modification on : Tuesday, August 6, 2019 - 1:01:22 AM


19. On certain types of Produc...
Publisher files allowed on an open archive


  • HAL Id : hal-02263306, version 1



Sudev Naduvath. On Certain Types of Product Set-Labeling of Graphs. Journal of Combinatorics, Information & System Sciences, Delhi: Forum for Interdisciplinary Mathematics, 2018. ⟨hal-02263306⟩



Record views


Files downloads