RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2011 Number 3(13), Pages 92–115 (Mi pdm339)

This article is cited in 14 papers

Applied Graph Theory

Structural and communicative properties of circulant networks

E. A. Monakhova

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

Abstract: Circulant graphs have been extensively investigated over the past 30 years and have the broad application to different fields of computer science and discrete mathematics. Two surveys on circulant networks have been published in English: by Bermond, Comellas and Hsu (1995) and by Hwang (2003). In Russian, a survey on circulant networks is presented in a book of Monakhov and Monakhova (2000). The present paper includes the results which have not been presented in these works, and also some new results in the area of undirected circulant networks research obtained during the last years.

Keywords: interconnection networks, circulant graphs, diameter, routing, broadcasting and gossiping.

UDC: 519.87



© Steklov Math. Inst. of RAS, 2025