Abstract:
In a field of network design, engineers desire better ways to design efficient
communication network. While designing such network, we are restricted with
engineering constraints such as communication delays and hardware costs. Many
construction techniques have been proposed. In this paper we focus on compounding techniques and provide (∆,D) tables that contain the largest compound graphs
for given degree ∆ and diameter D. We also empirically verify a few of the recently
discovered large compound graphs.
