Arithmetic Intger Additive Set-Idexers of Graph Operations

2014/05/27 by N. K. Sudev, K. A. Germina
Mathematics · #math.CO #msc:05C78

paper · pdf · doi:10.5373/jarpm.2053.052614

published as Journal of Advance Research in Pure Mathematics, Vol. 7, Issue. 1, 2015 pp. 70 - 82 · 10 pages, submitted. arXiv admin note: substantial text overlap with arXiv:1401.6040, arXiv:1405.6617, arXiv:1312.7674

arxiv created 2014/05/27 · arxiv updated 2015/04/13

Abstract

An integer additive set-indexer is an injective function f:V(G)→ 2^ℕ₀ such that the induced function g_f:E(G) → 2^ℕ₀ defined by g_f (uv) = f(u)+ f(v) is also injective. A graph G which admits an IASI is called an IASI graph. An arithmetic integer additive set-indexer is an integer additive set-indexer f, under which the set-labels of all elements of a given graph G are arithmetic progressions. In this paper, we discuss about admissibility of arithmetic integer additive set-indexers by certain graph operations and certain products of graphs.

Citations

• Associated Graphs of Certain Arithmetic IASI Graphs
• A Study on Arithmetic Integer Additive Set-Indexers of Graphs