-
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...
- 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...
-
graph Cameron graph Petersen graph Hall–Janko
graph Hoffman–Singleton
graph Higman–
Sims graph Paley graph of
order 13
Shrikhande graph Schläfli
graph...
- Gone Fishin' Developer(s)
SimGraph Publisher(s)
Amtex Platform(s) DOS
Release 1994 Genre(s)
Fishing Mode(s) Single-player...
- 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...
- construction, one can
embed the
Gewirtz graph in the Higman–
Sims graph. The
characteristic polynomial of the
Gewirtz graph is ( x − 10 ) ( x − 2 ) 35 ( x + 4...
- 0, 1). The
Sims-Gewirtz
graph is an (56, 10, 0, 2). The M22
graph aka the
Mesner graph is an srg(77, 16, 0, 4). The Brouwer–Haemers
graph is an srg(81...
-
Examples of
vector spaces Fano
plane Frieze group Gray
graph Hall–Janko
graph Higman–
Sims graph Hilbert matrix Illustration of a low-discrepancy sequence...
-
MacNeill Sierra On-Line
Goldrunner 1993
James Dingle Gone Fishin' 1994
SimGraph Amtex Goody 1987
Opera Soft
Opera Soft
Gorillas 1991
Microsoft Game Studios...
-
graph theory, a
graph product is a
binary operation on
graphs. Specifically, it is an
operation that
takes two
graphs G1 and G2 and
produces a
graph H...
