Weak Integer Additive Set-Indexers of Certain Graph Operations
Overview & Synopsis
An integer additive set-indexer is defined as an injective function such that the induced function defined by is also injective, where is the sum set of and and is the set of all non-negative integers. If , then is said to be a -uniform integer additive set-indexers. An integer additive set-indexer is said to be a weak integer additive set-indexer if . We have some characteristics of the graphs which admit weak integer additive set-indexers. In this paper, we study the admissibility of weak integer additive set-indexer by certain finite graph operations.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Weak Integer Additive Set-Indexers of Certain Graph Operations |
|---|---|
| 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-156664 |
| Original Source Link | Visit Source Page on hal.science » |