Search Results for ""

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...

The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...