A study on prime arithmetic integer additive set-indexers of graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Proyecciones Journal of Mathematics Année : 2017

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

Résumé

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.
Fichier principal
Vignette du fichier
7. A study on Prime arithmetic integer additive set-indexers of graphs (2017)[Proy. J. Math.].pdf (176.11 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02263312 , version 1 (05-08-2019)

Identifiants

  • HAL Id : hal-02263312 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More