Show simple item record

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

dc.creatorSudev, N. K.
dc.creatorGermina, K. A.
dc.date2017-06-02
dc.date.accessioned2019-11-14T12:00:14Z
dc.date.available2019-11-14T12:00:14Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1651
dc.identifier10.4067/S0716-09172017000200195
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113330
dc.descriptionLet N₀ be the set of all non-negative integers and P(N₀)be its power set. An integer additive set-indexer (IASI) is defined as an injective function f:V (G) → P(N₀) such that the induced function f⁺: E (G) → P(N₀) defined by f⁺(uv) = f(u) + f(v) is also injective, where N₀ 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.en-US
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1651/1332
dc.rightsDerechos de autor 2017 Proyecciones. Journal of Mathematicses-ES
dc.rightshttps://creativecommons.org/licenses/by-nc/4.0/es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 36 No 2 (2017); 195-208en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 36 Núm. 2 (2017); 195-208es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectInteger additive set-indexersen-US
dc.subjectArithmetic integer additive set-indexersen-US
dc.subjectPrime arithmetic integer additive set-indexersen-US
dc.titleA study on prime arithmetic integer additive set-indexers of graphs.en-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record