Search Results for ""

An optical illusion in which the orientation of arrowheads makes one line segment look longer than another. In the above figure, the line segments on the left and right are ...

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

The points on a line can be put into a one-to-one correspondence with the real numbers.

The roulette of the pole of a hyperbolic spiral rolling on a straight line is a tractrix.