This article is cited in 4 papers

Optimization of quadruple circulant networks

È. A. Monakhova

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences

Abstract: The problem of maximization of the number of nodes for a fixed degree and diameter for circulant networks is considered. The known lower bound for the maximum order of quadruple circulant networks is improved by $O(\frac32d^3)$ for any odd diameter $d>1$. A family of circulant networks is found at which the obtained estimate is attained. Tabl. 1, bibl. 7.

Keywords: circulant networks, diameter, the maximum order of a graph.

UDC: 519.87

Received: 14.02.2008
Revised: 05.05.2008

Bibliographic databases:

• 
•