Search Results for ""

Wavelets are a class of a functions used to localize a given function in both space and scaling. A family of wavelets can be constructed from a function psi(x), sometimes ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

Five or six Wolf prizes are awarded yearly to outstanding living scientists and artists for achievements in the interest of mankind and friendly relations among peoples. In ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1), exists stands for exists, forall means for all, in stands for ...

Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...