|
Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 5, Pages 56–66
(Mi da625)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Multiplicative circulant networks
E. A. Monakhova Institute of Computanional Technologies, Novosibirsk, Russia
Abstract:
We consider the problem of maximization of the number of nodes for the given degree and diameter of circulant networks. Study of the class of multiplicative circulant networks in which the chord lengths are the powers of an odd number makes it possible to obtain new improved lower estimates of the number of nodes of circulant networks for any dimension $k\ge4$. The infinite families of circulant networks attaining the found bounds are constructed. Bibliogr. 13.
Keywords:
circulant network, diameter, maximal order of a graph.
Received: 10.03.2010 Revised: 01.07.2010
Citation:
E. A. Monakhova, “Multiplicative circulant networks”, Diskretn. Anal. Issled. Oper., 17:5 (2010), 56–66
Linking options:
https://www.mathnet.ru/eng/da625 https://www.mathnet.ru/eng/da/v17/i5/p56
|
Statistics & downloads: |
Abstract page: | 347 | Full-text PDF : | 108 | References: | 39 | First page: | 2 |
|