Further Studies on the Sparing Number of Graphs
Overview & Synopsis
Let N 0 denote the set of all non-negative integers and P(N 0) be its power set. An integer additive set-indexer is an injective function f : V (G) → P(N 0) such that the induced function f + : E(G) → P(N 0) defined by f + (uv) = f (u)+f (v) is also injective, where f (u)+f (v) is the sum set of f (u) and f (v). If f + (uv) = k ∀ uv ∈ E(G), then f is said to be a k-uniform integer additive set-indexer. An integer additive set-indexer f is said to be a weak integer additive set-indexer if |f + (uv)| = max(|f (u)|, |f (v)|) ∀ uv ∈ E(G). In this paper, we study the admissibility of weak integer additive set-indexer by certain graphs and graph operations. Keywords: Integer additive set-indexers, weak integer additive set-indexers, weakly uniform integer additive set-indexers, mono-indexed elements of a graph, sparing number of a graph.
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Further Studies on the Sparing Number of Graphs |
|---|---|
| Author / Organization | Sudev Naduvath, K A Germina |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2014 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-156669 |
| Original Source Link | Visit Source Page on hal.science » |