Open Problems on Integral Sum Labellings

Abstract

Let be a simple graph and be the set of all integers. An integral sum graph of a set of integers as the graph having as its vertex set, with two vertices adjacent whenever their sum is in A graph so obtained is called an integral sum graph. In other words, an integral sum graph of a finite subset is the graph with if and only if And is called an integral sum labelling of In the paper, many obtained conclusions are summarized and relevant open problem is raised.