TOPICS
Search

Search Results for ""


311 - 320 of 1120 for Small World NetworkSearch Results
The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...
The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...
The word "number" is a general term which refers to a member of a given (possibly ordered) set. The meaning of "number" is often clear from context (i.e., does it refer to a ...
The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...
A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...
A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...
A circle with an arrow indicating a direction.
Not concentric.
The radius of the smallest circle centered at one of the points of an N-cluster, which contains all the points in the N-cluster.
The number of inward directed graph edges from a given graph vertex in a directed graph.
1 ... 29|30|31|32|33|34|35 ... 112 Previous Next

...