In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1,20). This means that it has 729 vertices, and 40824 edges (112 per vertex). Each edge is in a unique triangle (it is a locally linear graph) and each non-adjacent pair of vertices have exactly 20 shared neighbors. It is named after Richard A. Games, who suggested its construction in an unpublished communication[1] and wrote about related constructions.[2]
^Cite error: The named reference vlb was invoked but never defined (see the help page).
^Cite error: The named reference g was invoked but never defined (see the help page).
In graph theory, the Gamesgraph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1...
mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other...
interfaces and tools which enable developers to integrate with the open "social graph" of personal relations and other things like songs, places, and Facebook...
A scene graph is a general data structure commonly used by vector-based graphics editing applications and modern computer games, which arranges the logical...
graph (81 vertices), Berlekamp–van Lint–Seidel graph (243 vertices), and Gamesgraph (729 vertices). In enumerative combinatorics, there are 3n signed subsets...
the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly...
a universal graph is an infinite graph that contains every finite (or at-most-countable) graph as an induced subgraph. A universal graph of this type...
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices. 'Game play' is composed of a series of pebbling...
The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring...
computer science: Can the graph isomorphism problem be solved in polynomial time? (more unsolved problems in computer science) The graph isomorphism problem...
hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two...
In graph theory and recreational mathematics, the Hanoi graphs are undirected graphs whose vertices represent the possible states of the Tower of Hanoi...
of graph theory, the odd graphs are a family of symmetric graphs defined from certain set systems. They include and generalize the Petersen graph. The...
Microsoft Graph is a Microsoft API developer platform that connects multiple services and devices. Initially released in November 2015 as Office 365 Unified...
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
Grapher is a computer program bundled (with no additional cost) with macOS since version 10.4 that is able to create 2D and 3D graphs from simple and...
In the mathematical field of graph theory, the pancake graph Pn or n-pancake graph is a graph whose vertices are the permutations of n symbols from 1 to...
In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the...
A parity game is played on a colored directed graph, where each node has been colored by a priority – one of (usually) finitely many natural numbers....
Node graph architecture is a software design structured around the notion of a node graph. Both the source code and the user interface are designed around...
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights...
In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph. In...
In geometric graph theory, a penny graph is a contact graph of unit circles. It is formed from a collection of unit circles that do not cross each other...
Global Information