Papers
Topics
Authors
Recent
Search
2000 character limit reached

Associated Graphs of Certain Arithmetic IASI Graphs

Published 23 Jan 2014 in math.CO | (1401.6040v3)

Abstract: An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2{\mathbb{N}_0}$ such that the induced function $f+:E(G) \rightarrow 2{\mathbb{N}_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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.