Concepts inFOGGER: an algorithm for graph generator discovery

Generating set of a group

In abstract algebra, a generating set of a group is a subset that is not contained in any proper subgroup of the group. Equivalently, a generating set of a group is a subset such that every element of the group can be expressed as the combination (under the group operation) of finitely many elements of the subset and their inverses.
more from Wikipedia

Electric generator

In electricity generation, an electric generator is a device that converts mechanical energy to electrical energy. A generator forces electric charge (usually carried by electrons) to flow through an external electrical circuit. It is analogous to a water pump, which causes water to flow (but does not create water).
more from Wikipedia

Subgraph isomorphism problem

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H. Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete. However certain other cases of subgraph isomorphism may be solved in polynomial time.
more from Wikipedia

Closure (mathematics)

A set has closure under an operation if performance of that operation on members of the set always produces a member of the same set. For example, the real numbers are closed under subtraction, but the natural numbers are not: 3 and 8 are both natural numbers, but the result of 3 ¿ 8 is not a natural number. Another example is the set containing only the number zero, which is a closed set under multiplication.
more from Wikipedia

Glossary of graph theory

Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to describe current usage.
more from Wikipedia

Complete graph

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A drawing of a complete graph, with its vertices placed on a regular polygon, is sometimes referred to as a mystic rose.
more from Wikipedia