A study on prime arithmetic integer additive set-indexers of graphs

Abstract : Let N 0 be the set of all non-negative integers and P(N 0) be its power set. An integer additive set-indexer (IASI) is defined as 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 N 0 is the set of all non-negative integers. A graph G which admits an IASI is called an IASI graph. An IASI of a graph G is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of G are in arithmetic progressions. In this paper, we discuss about a particular type of arithmetic IASI called prime arithmetic IASI.
Document type :
Journal articles
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02263312
Contributor : Sudev Naduvath <>
Submitted on : Monday, August 5, 2019 - 4:15:17 PM
Last modification on : Wednesday, August 7, 2019 - 1:01:37 AM

File

7. A study on Prime arithmetic...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-02263312, version 1

Collections

Citation

Sudev Naduvath, K. Germina. A study on prime arithmetic integer additive set-indexers of graphs. Proyecciones Journal of Mathematics, 2017, 36, pp.195 - 208. ⟨hal-02263312⟩

Share

Metrics

Record views

2

Files downloads

3