Search Results for ""
171 - 180 of 1013 for neighborhood of vertexSearch Results
A relation connecting the values of a meromorphic function inside a disk with its boundary values on the circumference and with its zeros and poles (Jensen 1899, Levin 1980). ...
A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...
The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...
There are at least two integrals called the Poisson integral. The first is also known as Bessel's second integral, ...
Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...
Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...
A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...
The perpendicular foot, also called the foot of an altitude, is the point on the leg opposite a given vertex of a triangle at which the perpendicular passing through that ...
A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...
The uniform polychora are four-dimensional analogs of the uniform polyhedra. In fact, the uniform polyhedra are cells of the uniform polychora. There are more than 8000 known ...
...
View search results from all Wolfram sites (33924 matches)

