-
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 srg(100...
-
MacNeill Sierra On-Line
Goldrunner 1993
James Dingle Gone Fishin' 1994
SimGraph Amtex Goody 1987
Opera Soft
Opera Soft
Gorillas 1991
Microsoft Game Studios...
-
automorphism group is the
Mathieu group M22.
Cameron graph Higman–
Sims graph Gewirtz graph "Mesner
graph with
parameters (77,16,0,4). The
automorphism group...
- the
group of
automorphisms of the Higman–
Sims graph. The Higman–
Sims graph has 100 nodes, so the Higman–
Sims group HS is a
transitive group of permutations...
- one another,
which is
denoted x ∼ y {\displaystyle x\
sim y} . A
directed graph or
digraph is a
graph in
which edges have orientations. In one restricted...
-
graph Cameron graph Petersen graph Hall–Janko
graph Hoffman–Singleton
graph Higman–
Sims graph Paley graph of
order 13
Shrikhande graph Schläfli
graph...
- In
graph theory, a tree is an
undirected graph in
which any two
vertices are
connected by
exactly one path, or
equivalently a
connected acyclic undirected...
-
Examples of
vector spaces Fano
plane Frieze group Gray
graph Hall–Janko
graph Higman–
Sims graph Hilbert matrix Illustration of a low-discrepancy sequence...
- The Brouwer–Haemers
graph is an srg(81, 20, 1, 6). The Higman–
Sims graph is an srg(100, 22, 0, 6). The
Local McLaughlin graph is an srg(162, 56, 10...
-
SimRank is a
general similarity measure,
based on a
simple and
intuitive graph-theoretic model.
SimRank is
applicable in any
domain with object-to-object...
