Search Results for ""

There are two types of functions known as Hankel functions. The more common one is a complex function (also called a Bessel function of the third kind, or Weber Function) ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

A merit function, also known as a figure-of-merit function, is a function that measures the agreement between data and the fitting model for a particular choice of the ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

A function that exhibits oscillation (i.e., slope changes) is said to be oscillating, or sometimes oscillatory.

A function w(x) used to normalize orthogonal functions int[f_n(x)]^2w(x)dx=N_n.

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

An upper semicontinuous function whose restrictions to all complex lines are subharmonic (where defined). These functions were introduced by P. Lelong and Oka in the early ...