Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3115511> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Q3115511 subject Q7217286.
- Q3115511 subject Q8546843.
- Q3115511 subject Q8647012.
- Q3115511 abstract "In mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph with 100 vertices and valency 22, where no neighboring pair of vertices share a common neighbor and each non-neighboring pair of vertices share six common neighbors. It was first constructed by Mesner (1956) and rediscovered in 1968 by Donald G. Higman and Charles C. Sims as a way to define the Higman–Sims group, and that group is a subgroup of index two in the group of automorphisms of the Higman–Sims graph.Construction begins with the M22 graph, whose 77 vertices are the blocks of the S(3,6,22) Steiner system W22. Adjacent vertices are defined to be disjoint blocks. This graph is strongly regular; any vertex has 16 neighbors, any 2 adjacent vertices have no common neighbors, and any 2 non-adjacent vertices have 4 common neighbors. This graph has M22:2 as its automorphism group, M22 being a Mathieu group.The Higman–Sims graph is then formed by appending the 22 points of W22 and a 100th vertex C. The neighbors of C are defined to be those 22 points. A point adjacent to a block is defined to be one that is included.A Higman–Sims graph can be partitioned into two copies of the Hoffman–Singleton graph in 352 ways.".
- Q3115511 thumbnail Higman_Sims_Graph.svg?width=300.
- Q3115511 wikiPageWikiLink Q1239881.
- Q3115511 wikiPageWikiLink Q131476.
- Q3115511 wikiPageWikiLink Q141488.
- Q3115511 wikiPageWikiLink Q1464168.
- Q3115511 wikiPageWikiLink Q166504.
- Q3115511 wikiPageWikiLink Q245462.
- Q3115511 wikiPageWikiLink Q2510203.
- Q3115511 wikiPageWikiLink Q273037.
- Q3115511 wikiPageWikiLink Q291126.
- Q3115511 wikiPageWikiLink Q3036983.
- Q3115511 wikiPageWikiLink Q3090387.
- Q3115511 wikiPageWikiLink Q3117686.
- Q3115511 wikiPageWikiLink Q3180727.
- Q3115511 wikiPageWikiLink Q4391289.
- Q3115511 wikiPageWikiLink Q4420916.
- Q3115511 wikiPageWikiLink Q624580.
- Q3115511 wikiPageWikiLink Q692823.
- Q3115511 wikiPageWikiLink Q7217286.
- Q3115511 wikiPageWikiLink Q782566.
- Q3115511 wikiPageWikiLink Q826467.
- Q3115511 wikiPageWikiLink Q8546843.
- Q3115511 wikiPageWikiLink Q8647012.
- Q3115511 wikiPageWikiLink Q934200.
- Q3115511 wikiPageWikiLink Q942433.
- Q3115511 comment "In mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph with 100 vertices and valency 22, where no neighboring pair of vertices share a common neighbor and each non-neighboring pair of vertices share six common neighbors. It was first constructed by Mesner (1956) and rediscovered in 1968 by Donald G. Higman and Charles C.".
- Q3115511 label "Higman–Sims graph".
- Q3115511 depiction Higman_Sims_Graph.svg.