Search Results for ""

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

The term "amplitude" is used to refer to the magnitude of an oscillation, so the amplitude of the sinusoid y=Asin(omegat) is |A|, where |A| is the absolute value of A. The ...

A simple polygon with precisely two ears and one mouth.

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

A type of sale in which members of a group of buyers offer ever increasing amounts. The bidder making the last bid (for which no higher bid is subsequently made within a ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The baby monster group, also known as Fischer's baby monster group, is the second-largest sporadic group. It is denoted B and has group order |B| = ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

If M^3 is a closed oriented connected 3-manifold such that every simple closed curve in M lies interior to a ball in M, then M is homeomorphic with the hypersphere, S^3.