Search Results for ""
671 - 680 of 2464 for Graph PowerSearch Results
The inertial subranges of velocity power spectra for homogeneous turbulence exhibit a power law with exponent -5/3. This exponent (-5/3) is called the Kolmogorov constant by ...
A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.
An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...
A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.
Given a power spectrum (a plot of power vs. frequency), aliasing is a false translation of power falling in some frequency range (-f_c,f_c) outside the range. Aliasing is ...
When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...
A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).
Graph Strength
An n-fold multimagic cube is a magic cube that remains magic when each element is squared, cubed, etc., up to nth power. (Of course, when the elements of a cube are taken to ...
The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...
...
View search results from all Wolfram sites (331480 matches)

