Search Results for ""

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

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

The White House switchboard constant is the name given by Munroe (2012) to the constant W = exp[-(1+8^(1/(e-1)))^(1/pi)] (1) = 0.202456141492... (2) (OEIS A182064), the first ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...