A Study on Topological Integer Additive Set-Labeling of Graphs
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}...
Main Author: | Sudev Naduvath |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2015-03-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/90 |
Similar Items
-
Topological Integer Additive Set-Sequential Graphs
by: Sudev Naduvath, et al.
Published: (2015-07-01) -
On topological integer additive set-labeling of star graphs
by: Hafizh M. Radiapradana, et al.
Published: (2018-10-01) -
A Study on the Nourishing Number of Graphs and Graph Powers
by: Sudev Naduvath, et al.
Published: (2015-03-01) -
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
by: Jing Su, et al.
Published: (2024-09-01) -
Some classes of dispersible dcsl-graphs
by: J. Jinto, et al.
Published: (2018-01-01)