ScholarLens Back to search
2014•Unpublished venueOpen access

Weak Integer Additive Set-Indexers of Certain Graph Products

Sudev Naduvath, K. A. Germina

Open full text 3 citations

Abstract

Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f: V (G) → P(N0) such that the induced function f+: E(G) → P(N0) defined by f+(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). An IASI f is said to be a weak IASI if |f+(uv) | = max(|f(u)|, |f(v)|) ∀ uv ∈ E(G). In this paper, we study the admissibility of weak IASI by certain graph products of two weak IASI graphs. Key Words: Integer additive set-indexers, mono-indexed elements of a graph, weak integer additive set-indexers, sparing number of a graph. AMS Subject Classification: 05C78 1

About this research paper

What this paper is about

Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f: V (G) → P(N0) such that the induced function f+: E(G) → P(N0) defined by f+(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). An IASI f is said to be a weak IASI if |f+(uv) | = max(|f(u)|, |f(v)|) ∀ uv ∈ E(G). In this paper, we study the admissibility of weak IASI by certain graph products of two weak IASI graphs. Key Words: Integer additive set-indexers, mono-indexed elements of a graph, weak integer additive set-indexers, sparing number of a graph. AMS Subject Classification: 05C78 1

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f: V (G) → P(N0) such that the induced function f+: E(G) → P(N0) defined by f+(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). An IASI f is said to be a weak IASI if |f+(uv) | = max(|f(u)|, |f(v)|) ∀ uv ∈ E(G). In this paper, we study the admissibility of weak IASI by certain graph products of two weak IASI graphs. Key Words: Integer additive set-indexers, mono-indexed elements of a graph, weak integer additive set-indexers, sparing number of a graph. AMS Subject Classification: 05C78 1

Key concepts: Injective function, Graph, Combinatorics, Integer (computer science), Power set, Mathematics, Function (biology), Set (abstract data type)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Weak Integer Additive Set-Indexers of Certain Graph Products — Research Paper | ScholarLens