2014/05/31 by N. K. Sudev, K. A. Germina
Mathematics · #math.CO #msc:05C78
paper · pdf · doi:10.1142/s1793830915500251
published as Discrete Mathematics, Algorithms and Applications, Vol.7, Issue. 3, 2015, 1-15 · 14 pages, submitted. arXiv admin note: substantial text overlap with arXiv:1312.7674, arXiv:1403.6435
arxiv created 2014/08/23 · arxiv updated 2015/06/18
Let ℕ0 denote the set of all non-negative integers and P(ℕ0) be its power set. An integer additive set-indexer (IASI) of a graph G is an injective function f:V(G)→ P(ℕ0) such that the induced function f+:E(G) → P(ℕ0) defined by f+ (uv) = f(u)+ f(v) is also injective, where ℕ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 two special types of arithmetic IASIs.