Search Results for ""

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

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

The tridiminished icosahedron is Johnson solid J_(63). Interestingly, its skeleton has the same degree sequence as the triangular cupola.

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

The augmented truncated tetrahedron is Johnson solid J_(65) constructed by affixing a triangular cupola to one of the hexagonal faces of a truncated tetrahedron such that the ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

The (general) icosahedron is a 20-faced polyhedron (where icos- derives from the Greek word for "twenty" and -hedron comes from the Indo-European word for "seat"). Examples ...