2014/01/31 by N. K. Sudev, K. A. Germina · 1 citation
Mathematics · #math.CO #msc:05C78
published as International Journal of Mathematics and Soft Computing, Vol.4 Issu 2, 2014, pp.71-80 · 11 pages. arXiv admin note: text overlap with arXiv:1312.7674, arXiv:1312.7672
arxiv created 2014/07/18 · arxiv updated 2014/07/21
An integer additive set-indexer is defined as an injective function f:V(G)→ 2ℕ0 such that the induced function f+:E(G) → 2ℕ0 defined by 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 associated graphs of the given graph G, like line graph, total graph, etc.