A Study on Topological Integer Additive Set-Labeling of Graphs
2015  //  DOI: 10.5614/ejgta.2015.3.1.8
Sudev Naduvath

Metrics

  • Eye Icon 258 views
  • Download Icon 89 downloads
Metrics Icon 258 views  //  89 downloads
A Study on Topological Integer Additive Set\u002DLabeling of Graphs Image
Abstract

A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\to \mathcal{P}(X)-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus}f(v)$ for every $uv{\in} E(G)$ is also injective. Let $G$ be a graph and let $X$ be a non-empty set. A set-indexer $f:V(G)\to \mathcal{P}(X)$ is called a topological set-labeling of $G$ if $f(V(G))$ is a topology of $X$. An integer additive set-labeling is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$, whose associated function $f^+:E(G)\to \mathcal{P}(\mathbb{N}_0)$ is defined by $f(uv)=f(u)+f(v), uv\in E(G)$, where $\mathbb{N}_0$ is the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ is its power set. An integer additive set-indexer is an integer additive set-labeling such that the induced function $f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. In this paper, we extend the concepts of topological set-labeling of graphs to topological integer additive set-labeling of graphs.

Full text
Show more arrow
 
More from this journal
On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles
On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles Image
On Middle Cube Graphs
On Middle Cube Graphs Image
šŸ§  Browse all from this journal

Metrics

  • Eye Icon 258 views
  • Download Icon 89 downloads
Metrics Icon 258 views  //  89 downloads