On construction of multidimensional circulant graphs of diameter two
The paper considers the task of optimization of undirected circulant networks consisting in maximizing a number of nodes at predetermined graph degree and diameter. New lower bounds of a number of nodes for circulant networks of any degrees and diameter two were obtained. For the first time the infi...
Main Author: | E. A. Monakhova |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Tomsk Polytechnic University
2009-06-01
|
Series: | Известия Томского политехнического университета: Инжиниринг георесурсов |
Subjects: | |
Online Access: | http://izvestiya.tpu.ru/archive/article/view/1077 |
Similar Items
-
On construction of multidimensional circulant graphs of diameter two
by: E. A. Monakhova
Published: (2009-06-01) -
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
by: Hebert Perez-Roses
Published: (2014-10-01) -
On transitivity and connectedness of Cayley graphs of gyrogroups
by: Rasimate Maungchang, et al.
Published: (2021-05-01) -
The metric dimension of the circulant graph with 2k generators can be less than k
by: Tomáš Vetrík, et al.
Published: (2023-10-01) -
On the symmetries of some classes of recursive circulant graphs
by: Seyed Morteza Mirafzal
Published: (2014-03-01)