Associated Graphs of Certain Arithmetic IASI Graphs
Abstract
An integer additive set-indexer is defined as an injective function f:V(G)→ 2N0 such that the induced function f+:E(G) → 2N0 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.