A Study on the Nourishing Number of Graphs and Graph Powers
Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\mathbb{N}_{0})\) such that the induced edge-function \...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2015-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2227-7390/3/1/29 |