Search Results for ""

A square grid is a grid formed by tiling the plane regularly with squares.

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

Let the greatest term H of a sequence be a term which is greater than all but a finite number of the terms which are equal to H. Then H is called the upper limit of the ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

Although the rigidity theorem states that if the faces of a convex polyhedron are made of metal plates and the polyhedron edges are replaced by hinges, the polyhedron would ...

A polyhedron is rigid if it cannot be continuously deformed into another configuration. A rigid polyhedron may have two or more stable forms which cannot be continuously ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...