Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound. An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Moore graphs were named by Hoffman

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.