TOPICS
Search

Search Results for ""


651 - 660 of 782 for ConnectedSearch Results
The gyroid, illustrated above, is an infinitely connected periodic minimal surface containing no straight lines (Osserman 1986) that was discovered by Schoen (1970). ...
The Heaviside step function is a mathematical function denoted H(x), or sometimes theta(x) or u(x) (Abramowitz and Stegun 1972, p. 1020), and also known as the "unit step ...
On a Riemannian manifold M, tangent vectors can be moved along a path by parallel transport, which preserves vector addition and scalar multiplication. So a closed loop at a ...
"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...
A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...
The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...
The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...
Marion's theorem (Mathematics Teacher 1993, Maushard 1994, Morgan 1994) states that the area of the central hexagonal region determined by trisection of each side of a ...
If equilateral triangles DeltaABE_(AB), DeltaBCE_(BC), and DeltaACE_(AC) are erected externally on the sides of any triangle DeltaABC, then their centers N_(AB), N_(BC), and ...
A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...
1 ... 63|64|65|66|67|68|69 ... 79 Previous Next

...