A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Integral sum graphs from identification

1998
*
Discrete Mathematics
*

The idea of integral sum graphs was introduced by Harary (1994) . A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u) + f(v) = f(w) for some node w in G. A tree is said to be a generalized star if it can be obtained from a star by extending each edge to a path. A node of a tree T is said to be a fork of T if its degree is not equal to two. In this

doi:10.1016/s0012-365x(97)00046-0
fatcat:rsliaguf75fcxiyxqsxlz4vcuq