Search Results for ""

Every point which can be constructed with a straightedge and compass, and no other points, can be constructed using identical matchsticks (i.e., identical movable line ...

Consider a reference triangle DeltaABC and any given point P. The perpendiculars to AP, BP and CP respectively meet BC, AC and AB in three collinear points defining line l. ...

A number of attractive cube 6-compounds can be constructed. A first (left figures) is obtained by combining six cubes, each rotated by 1/6 of a turn about the line joining ...

Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...

An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...