Search Results for ""

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

Let gamma be a path given parametrically by sigma(t). Let s denote arc length from the initial point. Then int_gammaf(s)ds = int_a^bf(sigma(t))|sigma^'(t)|dt (1) = ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space. If (Y,*) is a pointed ...

The image of the path gamma in C under the function f is called the trace. This usage of the term "trace" is unrelated to the same term applied to matrices or tensors.

The term "pathological" is used in mathematics to refer to an example specifically cooked up to violate certain almost universally valid properties. Pathological problems ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...

According to G. Pólya, the method of finding geometric objects by intersection. 1. For example, the centers of all circles tangent to a straight line s at a given point P lie ...