Abstract
Let be the set of all non-negative integers and be its the power set. An integer additive set-indexer (IASI) of a graph is an injective function such that the induced function defined by is also injective, where is the sum set of and . An integer additive set-indexer is said to be a weak integer additive set-indexer (weak IASI) if . The minimum number of singleton set-labeled edges required for the graph to admit an IASI is called the sparing number of the graph. In this paper, we discuss the admissibility of weak IASI by a particular type of graph product called the edge corona of two given graphs and determine the sparing number of the edge corona of certain graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.