Search Results for ""

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 ...

There are two different definitions of the mid-arc points. The mid-arc points M_(AB), M_(AC), and M_(BC) of a triangle DeltaABC as defined by Johnson (1929) are the points on ...

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 ...

The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...

Miller's rules, originally devised to restrict the number of icosahedron stellations to avoid, for example, the occurrence of models that appear identical but have different ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

Minkowski space is a four-dimensional space possessing a Minkowski metric, i.e., a metric tensor having the form dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2. Alternatively ...

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

A function I_n(x) which is one of the solutions to the modified Bessel differential equation and is closely related to the Bessel function of the first kind J_n(x). The above ...