Search Results for ""

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 ...

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 ...

An apex graph is a graph possessing at least one vertex whose removal results in a planar graph. The set of vertices whose removal results in a planar graph is known as the ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

The Harries-Wong graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries graph. The Harries-Wong graph ...

The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...