Search Results for ""

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

Game theory is a branch of mathematics that deals with the analysis of games (i.e., situations involving parties with conflicting interests). In addition to the mathematical ...

A partial differential equation (PDE) is an equation involving functions and their partial derivatives; for example, the wave equation ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

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

An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every finite acyclic digraph has at least one node of ...