Search Results for ""

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

Let a straight line AB be divided internally at C and externally at D in the same ratio, so that (AC)/(CB)=-(AD)/(DB). Then AB is said to be divided harmonically at C and D ...

A real vector bundle pi:E->M has an orientation if there exists a covering by trivializations U_i×R^k such that the transition functions are vector space ...

A global field is either a number field, a function field on an algebraic curve, or an extension of transcendence degree one over a finite field. From a modern point of view, ...

When two cycles have a transversal intersection X_1 intersection X_2=Y on a smooth manifold M, then Y is a cycle. Moreover, the homology class that Y represents depends only ...