Search Results for ""
921 - 930 of 1453 for Distance FormulaSearch Results
![](/common/images/search/spacer.gif)
The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...
The modified bessel function of the second kind is the function K_n(x) which is one of the solutions to the modified Bessel differential equation. The modified Bessel ...
The rascal triangle is a number triangle with numbers arranged in staggered rows such that a_(n,r)=n(r-n)+1. (1) The published study of this triangle seems to have originated ...
A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...
A sum is the result of an addition. For example, adding 1, 2, 3, and 4 gives the sum 10, written 1+2+3+4=10. (1) The numbers being summed are called addends, or sometimes ...
The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...
The A graph is the graph on 6 vertices illustrated above. Unfortunately, at least one author (Farrugia 1999, p. 2) uses the term "A-graph" to refer to the 5-node bull graph. ...
The banner graph is the (4,1)-tadpole graph illustrated above. It could perhaps also be termed the 'P graph.' It is implemented in the Wolfram Language as ...
The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...
The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...
![](/common/images/search/spacer.gif)
...