Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Perkel_graph> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Perkel_graph abstract "In mathematics, the Perkel graph, named after Manley Perkel, is a weakly regular graph with 57 vertices and 171 edges. It is the unique distance-regular graph with intersection array (6, 5, 2; 1, 1, 3). The Perkel graph is also distance-transitive.It is also the skeleton of an abstract regular polytope, the 57-cell.".
- Perkel_graph thumbnail Perkel_graph_embeddings.svg?width=300.
- Perkel_graph wikiPageExternalLink Perkel.html.
- Perkel_graph wikiPageID "38025871".
- Perkel_graph wikiPageRevisionID "543246610".
- Perkel_graph edges "171".
- Perkel_graph hasPhotoCollection Perkel_graph.
- Perkel_graph imageCaption "Perkel graphs with 19-fold symmetry".
- Perkel_graph name "Perkel graph".
- Perkel_graph properties Distance-transitive_graph.
- Perkel_graph properties Regular_graph.
- Perkel_graph title "Perkel graph".
- Perkel_graph urlname "PerkelGraph".
- Perkel_graph vertices "57".
- Perkel_graph subject Category:Individual_graphs.
- Perkel_graph subject Category:Regular_graphs.
- Perkel_graph comment "In mathematics, the Perkel graph, named after Manley Perkel, is a weakly regular graph with 57 vertices and 171 edges. It is the unique distance-regular graph with intersection array (6, 5, 2; 1, 1, 3). The Perkel graph is also distance-transitive.It is also the skeleton of an abstract regular polytope, the 57-cell.".
- Perkel_graph label "Perkel graph".
- Perkel_graph sameAs m.0pcggyh.
- Perkel_graph sameAs Q7169007.
- Perkel_graph sameAs Q7169007.
- Perkel_graph wasDerivedFrom Perkel_graph?oldid=543246610.
- Perkel_graph depiction Perkel_graph_embeddings.svg.
- Perkel_graph isPrimaryTopicOf Perkel_graph.