Search Results for ""

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...

The straight line on which all points at infinity lie. The line at infinity is central line L_6 (Kimberling 1998, p. 150), and has trilinear equation aalpha+bbeta+cgamma=0, ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

A magic tesseract is a four-dimensional generalization of the two-dimensional magic square and the three-dimensional magic cube. A magic tesseract has magic constant ...

Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

The triangle DeltaM_AM_BM_C formed by joining the midpoints of the sides of a triangle DeltaABC. The medial triangle is sometimes also called the auxiliary triangle (Dixon ...