Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hoffman–Singleton_graph> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Hoffman–Singleton_graph abstract "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.".
- Hoffman–Singleton_graph thumbnail Hoffman-Singleton_graph.svg?width=300.
- Hoffman–Singleton_graph wikiPageID "4112667".
- Hoffman–Singleton_graph wikiPageRevisionID "602150800".
- Hoffman–Singleton_graph automorphisms "252000".
- Hoffman–Singleton_graph chromaticIndex "7".
- Hoffman–Singleton_graph chromaticNumber "4".
- Hoffman–Singleton_graph diameter "2".
- Hoffman–Singleton_graph edges "175".
- Hoffman–Singleton_graph girth "5".
- Hoffman–Singleton_graph name "Hoffman–Singleton graph".
- Hoffman–Singleton_graph namesake Alan_Hoffman_(mathematician).
- Hoffman–Singleton_graph namesake Robert_R._Singleton.
- Hoffman–Singleton_graph properties Cage_(graph_theory).
- Hoffman–Singleton_graph properties Hamiltonian_path.
- Hoffman–Singleton_graph properties Integral_graph.
- Hoffman–Singleton_graph properties Moore_graph.
- Hoffman–Singleton_graph properties Strongly_regular_graph.
- Hoffman–Singleton_graph properties Symmetric_graph.
- Hoffman–Singleton_graph radius "2".
- Hoffman–Singleton_graph vertices "50".
- Hoffman–Singleton_graph subject Category:4-chromatic_graphs.
- Hoffman–Singleton_graph subject Category:Individual_graphs.
- Hoffman–Singleton_graph subject Category:Regular_graphs.
- Hoffman–Singleton_graph comment "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.".
- Hoffman–Singleton_graph label "Graf Hoffmana-Singletona".
- Hoffman–Singleton_graph label "Grafo de Hoffman-Singleton".
- Hoffman–Singleton_graph label "Graphe de Hoffman-Singleton".
- Hoffman–Singleton_graph label "Hoffman–Singleton graph".
- Hoffman–Singleton_graph sameAs Hoffman%E2%80%93Singleton_graph.
- Hoffman–Singleton_graph sameAs Graphe_de_Hoffman-Singleton.
- Hoffman–Singleton_graph sameAs Graf_Hoffmana-Singletona.
- Hoffman–Singleton_graph sameAs Grafo_de_Hoffman-Singleton.
- Hoffman–Singleton_graph sameAs Q3090387.
- Hoffman–Singleton_graph sameAs Q3090387.
- Hoffman–Singleton_graph wasDerivedFrom Hoffman–Singleton_graph?oldid=602150800.
- Hoffman–Singleton_graph depiction Hoffman-Singleton_graph.svg.
