Search Results for ""

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A McNugget number is a positive integer that can be obtained by adding together orders of McDonald's® Chicken McNuggetsTM (prior to consuming any), which originally came in ...

The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...

The Mercator projection is a map projection that was widely used for navigation since loxodromes are straight lines (although great circles are curved). The following ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

There are two definitions of a metacyclic group. 1. A metacyclic group is a group G such that both its commutator subgroup G^' and the quotient group G/G^' are cyclic (Rose ...

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