Open AccessOpen Problems on Integral Sum Labellings
Author(s) -
Tian-Rui Ye,
AUTHOR_ID,
Haiying Wang,
AUTHOR_ID
Publication year - 2020
Publication title -
international journal of applied mathematics and machine learning
Language(s) - English
Resource type - Journals
ISSN - 2394-2258
DOI - 10.18642/ijamml_7100122153
Subject(s) - integral graph , mathematics , combinatorics , graph , vertex (graph theory) , discrete mathematics , graph labeling , graph power , voltage graph , butterfly graph , line graph
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.