Search Results for ""

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...

The first definition of the logarithm was constructed by Napier and popularized through his posthumous pamphlet (Napier 1619). It this pamphlet, Napier sought to reduce the ...

A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

A technical mathematical object defined in terms of a polynomial ring of n variables over a field k. Syzygies occur in tensors at rank 5, 7, 8, and all higher ranks, and play ...