Sum graphs over all the integers
โ
Frank Harary
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 392 KB
We introduced the sum graph of a set S of positive integers as the graph G+(S) having S as its node set, with two nodes adjacent whenever their sum is in S. Now we study sum graphs over all the integers so that S may contain positive or negative integers on zero. A graph so obtained is called an int