Search Results for ""

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

The finite group C_2×C_2 is one of the two distinct groups of group order 4. The name of this group derives from the fact that it is a group direct product of two C_2 ...

In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...

A property that is always fulfilled by the product of topological spaces, if it is fulfilled by each single factor. Examples of productive properties are connectedness, and ...

If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

An unordered factorization is a factorization of a number into a product of factors where order is ignored. The following table lists the unordered factorizations of the ...