Search Results for ""

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

A Lie algebra is nilpotent when its Lie algebra lower central series g_k vanishes for some k. Any nilpotent Lie algebra is also solvable. The basic example of a nilpotent Lie ...

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

Rational numbers are countable, so an order can be placed on them just like the natural numbers. Although such an ordering is not obvious (nor unique), one such ordering can ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

There are two types of squares inscribing reference triangle DeltaABC in the sense that all vertices lie on the sidelines of ABC. The first type has two adjacent vertices of ...

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...

The number of ways of folding a strip of stamps has several possible variants. Considering only positions of the hinges for unlabeled stamps without regard to orientation of ...