Search Results for ""

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of five homogeneous coordinates x_0:x_1:x_2:x_3:x_4, not all ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A nonsimply connected 3-manifold, also called a dodecahedral space.

If del xF=0 (i.e., F(x) is an irrotational field) in a simply connected neighborhood U(x) of a point x, then in this neighborhood, F is the gradient of a scalar field phi(x), ...

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...

A polygrammic prism is a prism formed by two regular polygrams offset along their symmetry axis and with corresponding edges connected by lateral faces. The hexagrammic prism ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

A phase curve (i.e., an invariant manifold) which meets a hyperbolic fixed point (i.e., an intersection of a stable and an unstable invariant manifold) or connects the ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...