TOPICS
Search

Search Results for ""


801 - 810 of 1536 for Small-World Network Average PathSearch Results
A curve of constant width constructed by drawing arcs from each polygon vertex of an equilateral triangle between the other two vertices. The Reuleaux triangle has the ...
The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...
Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...
B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...
The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...
Contour integration is the process of calculating the values of a contour integral around a given contour in the complex plane. As a result of a truly amazing property of ...
The hexagram is the star polygon {6/2}, also known as the star of David or Solomon's seal, illustrated at left above. It appears as one of the clues in the novel The Da Vinci ...
The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...
A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...
Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...
1 ... 78|79|80|81|82|83|84 ... 154 Previous Next

...