On Certain Types of Product Set-Labeling of Graphs
Résumé
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.
Fichier principal
19. On certain types of Product Set-labeling of graphs (2018)[J. Combin. Inform. System Sci.].pdf (201.08 Ko)
Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...