TOPICS
Search

Search Results for ""


291 - 300 of 1120 for Small World NetworkSearch Results
An equilibrium minimal surface for a crystal or drop which has the least anisotropic surface free energy for a given volume. It is the anisotropic analog of a sphere. In the ...
The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...
The pentagram, also called the five-point star, pentacle, pentalpha, or pentangle, is the star polygon {5/2}. It is a pagan religious symbol that is one of the oldest symbols ...
The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...
A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...
Discrete Mathematics
A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...
The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...
The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...
The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...
1 ... 27|28|29|30|31|32|33 ... 112 Previous Next

...