Search Results for ""
1511 - 1520 of 3922 for Line graphsSearch Results
The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...
The operation of exchanging all points of a mathematical object with their mirror images (i.e., reflections in a mirror). Objects that do not change handedness under ...
A right strophoid is the strophoid of a line L with pole O not on L and fixed point O^' being the point where the perpendicular from O to L cuts L is called a right ...
A ruled surface is a surface that can be swept out by moving a line in space. It therefore has a parameterization of the form x(u,v)=b(u)+vdelta(u), (1) where b is called the ...
A hyperboloid is a quadratic surface which may be one- or two-sheeted. The two-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the line ...
A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...
Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...
Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...
A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...
The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...
...
View search results from all Wolfram sites (28121 matches)

