Graph labelling; Ideal sumset labelling; Set-labelling; Sumset labelling
The sumset of two sets A and B of integers, denoted by A + B, is defined as (formula presented). Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G is an injective function (Formula Presented) such that the induced function (Formula Presented) is defined by (Formula presented). In this paper, we introduce the notion of ideal sumset labelling of graph and discuss the admissibility of this labelling by certain graph classes and discuss some structural characterization of those graphs. 2021 Jincy P. Mathai, Sudev Naduvath, and Satheesh Sreedharan. This is an open access article distributed under the terms of the Creative Commons License, which permits unrestricted use and distribution provided the original author and source are credited.
Mathai J.P., Muthoot Institute of Technology & Science, Dept of Mathematics, Puthencruz, KL, India; Naduvath S., CHRIST (Deemed to be University], Dept. of Mathematics, Bangalore, KA, India; Sreedharan S., Vidya Academy of Science & Technology, Dept. of Mathematics, Thrissur, KL, India