Search Results for ""

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

Triangle picking is the process of picking triangles at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a random ...

Related to or being the mathematically most simple case. More generally, the word "trivial" is used to describe any result which requires little or no effort to derive or ...

A formal type of proof most frequently encountered in elementary geometry courses in which known or derived statements are written in the left column, and the reason that ...

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

A particle P is said to be undergoing uniform circular motion if its radius vector in appropriate coordinates has the form (x(t),y(t),0), where x(t) = Rcos(omegat) (1) y(t) = ...

The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...