Difference between revisions of "File:Bosak.png"

From Combinatorics Wiki

CW>Nacho.Lopez
(The Bosák graph is the unique mixed Moore graph with undirected degree 3, directed out-degree 1 and diameter 2. It achieves the maximum number of vertices (Moore bound) with the prescribed degree/diameter restrictions.)
 
m (1 revision imported)
(No difference)

Revision as of 14:39, 3 January 2019

The Bosák graph is the unique mixed Moore graph with undirected degree 3, directed out-degree 1 and diameter 2. It achieves the maximum number of vertices (Moore bound) with the prescribed degree/diameter restrictions.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current11:02, 31 January 2019Thumbnail for version as of 11:02, 31 January 2019260 × 298 (16 KB)Grahame (talk | contribs)The Bosák graph is the unique mixed Moore graph with undirected degree 3, directed out-degree 1 and diameter 2. It achieves the maximum number of vertices (Moore bound) with the prescribed degree/diameter restrictions.
  • You cannot overwrite this file.

There are no pages that link to this file.