Search Results for ""
681 - 690 of 2138 for Complement graphSearch Results
The normal bundle of a submanifold N in M is the vector bundle over N that consists of all pairs (x,v), where x is in N and v is a vector in the vector quotient space ...
One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...
Let S be a nonempty set, then an ultrafilter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F. 2. If A,B in F, then A ...
A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...
In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...
The number of inward directed graph edges from a given graph vertex in a directed graph.
If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...
The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...
The number of outward directed graph edges from a given graph vertex in a directed graph.
The hyperbolic volume of the knot complement of a hyperbolic knot is a knot invariant. Adams (1994) lists the hyperbolic volumes for knots and links. The hyperbolic volume of ...
...
View search results from all Wolfram sites (13703 matches)

