Search Results for ""

A square integrable function phi(t) is said to be normal if int[phi(t)]^2dt=1. However, the normal distribution function is also sometimes called "the normal function."

A function f(x) is said to be nondecreasing on an interval I if f(b)>=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nonincreasing on an interval ...

A function f(x) is said to be nonincreasing on an interval I if f(b)<=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nondecreasing on an interval ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

A function f(x) decreases on an interval I if f(b)<=f(a) for all b>a, where a,b in I. If f(b)<f(a) for all b>a, the function is said to be strictly decreasing. Conversely, a ...

A function f(x) increases on an interval I if f(b)>=f(a) for all b>a, where a,b in I. If f(b)>f(a) for all b>a, the function is said to be strictly increasing. Conversely, a ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...