# A Study on the Product Set-Labeling of Graphs

Source: [A Study on the Product Set-Labeling of Graphs](<https://www.sota2.com/research/paper/68fa53921e209131ce9844a1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:41.138Z

Authors: N. K. Sudev

Published: 2017-01-01T03:46:41.000Z

## Abstract

Let $X$ be a non-empty ground set and $\\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\\to \\mathscr{P}(X)$ such that the induced function $f^\*:E(G) \\to \\mathscr{P}(X)$ is defined by $f^\*(uv)=f(u)\\ast f(v)$, where $f(u)\\ast f(v)$ is a binary operation of the sets $f(u)$ and $f(v)$. A graph which admits a set-labeling is known to be a set-labeled graph. A set-labeling $f$ of a graph $G$ is said to be a set-indexer of $G$ if the associated function $f^\*$ is also injective. In this paper, we introduce a new notion namely product set-labeling of graphs as an injective set-valued function $f:V(G)\\to \\mathscr{P}(\\mathbb{N})$ such that the induced edge-function $f^\*:V(G)\\to \\mathscr{P}(\\mathbb{N})$ is defined as $^\*f(uv)=f(u)\\ast f(v) \\forall\\ uv\\in E(G)$, where $f(u)\\ast f(v)$ is the product set of the set-labels $f(u)$ and $f(v)$, where $\\mathbb{N}$ is the set of all positive integers and discuss certain properties of the graphs which admit this type of set-labeling.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1701.00190>)

[PDF](<https://arxiv.org/pdf/1701.00190.pdf>)
