Integral sum graphs from identification (Q1381849)

A graph \(G= (V,E)\) is an integral sum graph if there is a function \(f:V\to\mathbb{Z}\) such that, for all \(u,v\in V\) with \(u\neq v\), we have \(\{u,v\}\in E\) iff \(f(w)= f(u)+ f(v)\) for some \(w\in V\). The notion of identification is used to prove for some graphs that they are integral sum graphs. An identification is the operation that takes two graphs and yields the graph obtained by identifying a specified vertex from both graphs. Conditions are given under which the identification of a caterpillar or a path with an integral sum graph yields an integral sum graph. This is used to prove that all generalized stars (trees with at most one vertex of degree at least three) and all trees with all vertices of degree at least three at distance at least four are integral sum graphs. The author conjectures that every tree is an integral sum graph.