TOPICS
Search

Search Results for ""


1041 - 1050 of 1141 for Randic Spectral RadiusSearch Results
The Struve function, denoted H_n(z) or occasionally H_n(z), is defined as H_nu(z)=(1/2z)^(nu+1)sum_(k=0)^infty((-1)^k(1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)), (1) where ...
Let DeltaABC be a triangle and D a point on the side BC. Let I be the incenter, P the center of the circle tangent to the circumcircle and segments AD and BD, Q the center of ...
The angular twist theta of a shaft with given cross section is given by theta=(TL)/(KG) (1) (Roark 1954, p. 174), where T is the twisting moment (commonly measured in units ...
An n-trapezohedron, also called an antidipyramid, antibipyramid, or deltohedron (not to be confused with a deltahedron), is a solid composed of interleaved symmetric ...
The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...
The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...
The area Delta (sometimes also denoted sigma) of a triangle DeltaABC with side lengths a, b, c and corresponding angles A, B, and C is given by Delta = 1/2bcsinA (1) = ...
The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...
A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...
Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...
1 ... 102|103|104|105|106|107|108 ... 115 Previous Next

...