A study on the product set-labeling of graphs

DOI10.1515/APAM-2016-0098MaRDI QIDQ520899zbMATH OpenOpenAlexFDO

Authors N. K. Sudev

Publication date 6 April 2017

Published in Advances in Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.00190

zbMATH Keywords

geometric product set-labeling of graphsproduct set-labeling of graphsset-labeling of graphsuniform product set-labeling of graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $X$ be a non-empty ground set and $mathscrP(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)omathscrP(X)$ such that the induced function $f^{\ast }:E(G)omathscrP(X)$ is defined by $f^{\ast }(uv)=f(u)astf(v)$, where $f(u)astf(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^{\ast }$ 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)omathscrP(mathbbN)$ such that the induced edge-function $f^{\ast }:V(G)omathscrP(mathbbN)$ is defined as ${}^{\ast }f(uv)=f(u)astf(v)foralluvinE(G)$, where $f(u)astf(v)$ is the product set of the set-labels $f(u)$ and $f(v)$, where $mathbbN$ is the set of all positive integers and discuss certain properties of the graphs which admit this type of set-labeling.

Recommendations

• On disjunctive and conjunctive set-labelings of graphs
• On certain types of product set-labeling of graphs
• A study on integer additive set-graceful graphs
• A study on topological integer additive set-labeling of graphs
• A study on the modular sumset labeling of graphs

Cites work

• scientific article; zbMATH DE number 3963158 (Why is no real title available?)
• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• On certain arithmetic integer additive set-indexers of graphs
• On weakly uniform integer additive set-indexers of graphs
• Some new results on strong integer additive set-indexers of graphs

Cited in

(5)

• scientific article; zbMATH DE number 6468166 (Why is no real title available?)
• On disjunctive and conjunctive set-labelings of graphs
• On sets of integers with restrictions on their products
• On labeling the vertices of products of complete graphs with distance constraints
• On certain types of product set-labeling of graphs

This page was built for publication: A study on the product set-labeling of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520899)