pith. sign in

arxiv: 1511.00678 · v1 · pith:K5SKQ47Onew · submitted 2015-11-01 · 🧮 math.GM

A Study on Integer Additive Set-Valuations of Signed Graphs

classification 🧮 math.GM
keywords additiveintegerfunctiongraphgraphsiaslsignedadmits
0
0 comments X
read the original abstract

Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to \cP(\N)-\{\emptyset\}$ is defined by $f^+ (uv) = f(u)+ f(v)$, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. A graph which admits an IASL is usually called an IASL-graph. An IASL $f$ of a graph $G$ is said to be an integer additive set-indexer (IASI) of $G$ if the associated function $f^+$ is also injective. In this paper, we define the notion of integer additive set-labeling of signed graphs and discuss certain properties of signed graphs which admits certain types of integer additive set-labelings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.