Search Results for ""

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

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 McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

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

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

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 index associated to a metric tensor g on a smooth manifold M is a nonnegative integer I for which index(gx)=I for all x in M. Here, the notation index(gx) denotes the ...

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 dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...