Search Results for ""

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

A node which is one graph edge further away from a given node in a rooted tree.

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

Generally, a face is a component polygon, polyhedron, or polytope. A two-dimensional face thus has vertices and edges, and can be used to make cells. More formally, a face is ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...