TOPICS
Search

Search Results for ""


651 - 660 of 1536 for Small-World Network Average PathSearch Results
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
The radius of an excircle. Let a triangle have exradius r_A (sometimes denoted rho_A), opposite side of length a and angle A, area Delta, and semiperimeter s. Then r_1 = ...
The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...
In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...
Any one of the eight Apollonius circles of three given circles is tangent to a circle H known as a Hart circle, as are the other three Apollonius circles having (1) like ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
Refer to the above figures. Let X be the point of intersection, with X^' ahead of X on one manifold and X^('') ahead of X of the other. The mapping of each of these points ...
Johnson's theorem states that if three equal circles mutually intersect one another in a single point, then the circle passing through their other three pairwise points of ...
The three circumcircles through the triangle centroid G of a given triangle DeltaA_1A_2A_3 and the pairs of the vertices of the second Brocard triangle are called the McCay ...
Let five circles with concyclic centers be drawn such that each intersects its neighbors in two points, with one of these intersections lying itself on the circle of centers. ...
1 ... 63|64|65|66|67|68|69 ... 154 Previous Next

...