2011•Journal of Applied and Industrial MathematicsRequires access
On an extremal family of circulant networks
Э. А. Монахова
Open publisher page 0 citations
Abstract
The paper addresses the optimization problem for circulant networks of maximizing the number of vertices given the degree and diameter of a graph. For the graphs in the best available extremal family of circulant networks, we improve the estimate for diameter, which together with previous results for multiplicative circulant networks enables us to improve the lower bounds for the attainable number of vertices of circulant networks of all dimensions k ≥ 4.