This article is cited in 3 papers

On an extremal family of circulant networks

E. A. Monakhova

Institute of Computational Technologies, Novosibirsk, Russia

Abstract: We consider the problem of maximization of the number of nodes of circulant networks for a given degree and diameter. The estimate of the diameter of graphs of the best known extremal family of circulant networks is improved that together with results given earlier for multiplicative circulant graphs allowed to improve the lower estimates of attainable number of nodes of circulant networks for any dimension $k\ge4$. Bibliogr. 12.

Keywords: circulant network, diameter, maximal order of a graph.

UDC: 519.87

Received: 29.07.2010
Revised: 11.11.2010

 English version: Journal of Applied and Industrial Mathematics, 2011, 5:4, 595–600

Bibliographic databases:

• 
• 
•