e/Hoffman-Singleton Graph

Information
has gloss	eng: In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1). It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest order Moore graph known to exist. Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage.
lexicalization	eng: Hoffman-Singleton graph
lexicalization	eng: Hoffman–Singleton graph
instance of	(noun) (computer science) the organization of data (and its storage allocations in a computer) data structure

Meaning
French
has gloss	fra: Le graphe de Petersen est, en théorie des graphes, un graphe possédant 50 sommets et 175 arêtes. Il doit son nom à Alan J. Hoffman et Robert R. Singleton qui le découvrirent en essayant de classifier les graphes de Moore.
lexicalization	fra: graphe de Hoffman-Singleton
Polish
has gloss	pol: Graf Hoffmana–Singletona jest grafem o następujących parametrach: * posiada 50 wierzchołków, * posiada 175 krawędzi, * stopień każdego wierzchołka wynosi 7, * średnica grafu wynosi 2, * obwód grafu wynosi 5.
lexicalization	pol: Graf Hoffmana-Singletona

Media
media:img	Hoffman singleton graph circle2.gif