Search Results for ""
631 - 640 of 2018 for Graph LoopSearch Results
The links curve is the quartic curve given by the Cartesian equation (x^2+y^2-3x)^2=4x^2(2-x). (1) The area enclosed by the outer envelope is A_(envelope)=1/6(9pi+8) (2) and ...
A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).
In the study of non-associative algebra, there are at least two different notions of what the half-Bol identity is. Throughout, let L be an algebraic loop and let x, y, and z ...
Given two functions f and g analytic in A with gamma a simple loop homotopic to a point in A, if |g(z)|<|f(z)| for all z on gamma, then f and f+g have the same number of ...
Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...
The mathematical study of the properties of the formal mathematical structures called graphs.
The multiplicity of a multigraph is its maximum edge multiplicity.
Refer to the above figures. Let X be the point of intersection, with X^' ahead of X on one manifold and X^('') ahead of X of the other. The mapping of each of these points ...
The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...
Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...
...
View search results from all Wolfram sites (18458 matches)

