TOPICS
Search

Search Results for ""


11181 - 11190 of 13135 for Computational GeometrySearch Results
Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...
The exponent is the component of a finite floating-point representation that signifies the integer power to which the radix is raised in determining the value of that ...
In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...
Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...
Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...
Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...
The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...
A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...
A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...
In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...

...