Construction of series of families of degree six circulant networks

We consider a solution to the problem of constructing a series of families of circulant networks of degree six, specified analytically with the help of two parameters, one of which is the diameter of the network. Based on the analysis and generalization of the properties of a new description of an extremal family of circulants, a general series of families of circulant graphs of degree six of arbitrary diameters is constructed, which includes extremal circulant graphs of degree six and new infinite families of circulants with an even number of vertices. In the found series of families, descriptions of a series of circulant graphs of any given diameter are analytically defined. Optimality ranges of series graphs are algorithmically identified, where optimal is understood as a circulant graph of degree six with the minimum possible diameter for a given number of vertices. The resulting series of families of circulant networks is promising as a scalable topology model for networks on a chip. Tab. 3, illustr. 3, bibliogr. 21.