Search Results for ""

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

A tangent point of two similar curves.

The trilinear quotient of two points p:q:r and u:v:w is the point p/u:q/v:r/w.

Suppose a line L^' meets sidelines BC, CA, and AB in points A^', B^', and C^', respectively. Let A^('') be the reflection of A^' about the midpoint of segment BC, and ...

Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...

Due to Lebesgue and Brouwer. If an n-dimensional figure is covered in any way by sufficiently small subregions, then there will exist points which belong to at least n+1 of ...

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...

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 points on a line can be put into a one-to-one correspondence with the real numbers.