Search Results for ""

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...

The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

The essential supremum is the proper generalization to measurable functions of the maximum. The technical difference is that the values of a function on a set of measure zero ...

A univariate function f(x) is said to be even provided that f(x)=f(-x). Geometrically, such functions are symmetric about the y-axis. Examples of even functions include 1 ...

A fair coin is tossed an even 2n number of times. Let D=|H-T| be the absolute difference in the number of heads and tails obtained. Then the probability distribution is given ...