Search Results for ""

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

The moment of inertia with respect to a given axis of a solid body with density rho(r) is defined by the volume integral I=intrho(r)r__|_^2dV, (1) where r__|_ is the ...

In a rectangular room (a cuboid) with dimensions 30^'×12^'×12^', a spider is located in the middle of one 12^'×12^' wall one foot away from the ceiling. A fly is in the ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

A multiplicative factor (usually indexed) such as one of the constants a_i in the polynomial a_nx^n+a_(n-1)x^(n-1)+...+a_2x^2+a_1x+a_0. In this polynomial, the monomials are ...

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...