TOPICS
Search

Search Results for ""


3371 - 3380 of 3715 for One-step equationsSearch Results
The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...
The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...
The Dirac matrices are a class of 4×4 matrices which arise in quantum electrodynamics. There are a variety of different symbols used, and Dirac matrices are also known as ...
The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...
Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...
The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...
Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...
The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...
The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...
Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...
1 ... 335|336|337|338|339|340|341 ... 372 Previous Next

...