Large graphs with given degree and diameter. II |
| |
| Authors: | JC Bermond C Delorme G Farhi |
| |
| Institution: | Laboratoire de Recherche en Informatique, ERA CNRS 452, Bât. 490, Université Paris Sud, 91405 Orsay, France |
| |
| Abstract: | The following problem arises in the study of interconnection networks: find graphs of given maximum degree and diameter having the maximum number of vertices. Constructions based on a new product of graphs, which enable us to construct graphs of given maximum degree and diameter, having a great number of vertices from smaller ones are given; therefore the best values known before are improved considerably. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
