A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Edge Sums Of De Bruijn Interconnection Networks
2003
International Journal of Computer Mathematics
An interconnection network is a highly symmetrical connected graph of order n nodes, size m edges, connectivity k and diameter d, where n and k are large but m and d are small. Many interconnection networks are defined algebraically in such a way that each node has an integer value. Then every edge can be assigned the sum of the two nodes it joins. These numbers are called the edge sums of the graph. The edge sum problem of a graph is to characterize the set of edge sums. This problem was
doi:10.1080/0020716031000087159a
fatcat:x7phmarbhfbzbah4o54rk4dlvm