Search Results for ""
211 - 220 of 479 for Arc TransitiveSearch Results
Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...
Let gamma(t) be a smooth curve in a manifold M from x to y with gamma(0)=x and gamma(1)=y. Then gamma^'(t) in T_(gamma(t)), where T_x is the tangent space of M at x. The ...
The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...
The length is the longest dimension of an object.
A curve consisting of two mirror-reversed intersecting crescents (lunes). This curve can be traced unicursally. The region common to both crescents is a lens.
The regular heptagon is the seven-sided regular polygon illustrated above, which has Schläfli symbol {7}. According to Bankoff and Garfunkel (1973), "since the earliest days ...
The areas of the regions illustrated above can be found from the equations A+4B+4C=1 (1) A+3B+2C=1/4pi. (2) Since we want to solve for three variables, we need a third ...
Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...
Two elements x and y of a set S are said to be commutative under a binary operation * if they satisfy x*y=y*x. (1) Real numbers are commutative under addition x+y=y+x (2) and ...
A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...
...
View search results from all Wolfram sites (2050 matches)

