العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
EspañolHOFFMAN–SINGLETON GRAPH
(Redirected from Hoffman-Singleton graph)
The two circles shaped Hoffman–Singleton graph and its component (50+25+25+25+25+25=175 edges).
The 'Hoffman–Singleton graph' is a graph with the following properties:
★ The graph has 50 vertices.
★ The graph has 175 edges.
★ The graph has a vertex degree of 7.
★ The graph has a diameter of 2.
★ The graph has a girth of 5.
Therefore, the graph is the following:
★ strongly regular.
★ A Moore graph.
★ An integral graph.
★ The (7,5)-cage.
A Hoffman–Singleton graph is the highest order Moore graph to be found, and all Hoffman–Singleton graphs will adhere to all eight properties listed above -- no matter how they are drawn.
The two circles shaped Hoffman–Singleton graph and its component (50+25+25+25+25+25=175 edges).
The 'Hoffman–Singleton graph' is a graph with the following properties:
★ The graph has 50 vertices.
★ The graph has 175 edges.
★ The graph has a vertex degree of 7.
★ The graph has a diameter of 2.
★ The graph has a girth of 5.
Therefore, the graph is the following:
★ strongly regular.
★ A Moore graph.
★ An integral graph.
★ The (7,5)-cage.
A Hoffman–Singleton graph is the highest order Moore graph to be found, and all Hoffman–Singleton graphs will adhere to all eight properties listed above -- no matter how they are drawn.
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves
