Search Results for ""

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...