TOPICS
Search

Search Results for "binary number"


9851 - 9860 of 13135 for binary numberSearch Results
If A is a graded module and there exists a degree-preserving linear map phi:A tensor A->A, then (A,phi) is called a graded algebra. Cohomology is a graded algebra. In ...
The term "gradient" has several meanings in mathematics. The simplest is as a synonym for slope. The more general gradient, called simply "the" gradient in vector analysis, ...
Let a Gram point g_n be called "good" if (-1)^nZ(g_n)>0, and "bad" otherwise (Rosser et al. 1969; Edwards 2001, p. 180). Then the interval between two consecutive good Gram ...
The granny knot is a composite knot of six crossings consisting of a knot sum of two left-handed trefoils with the same orientation (Rolfsen 1976, p. 220). The granny knot ...
The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...
The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...
The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...
The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...
In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...
Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...
1 ... 983|984|985|986|987|988|989 ... 1314 Previous Next

Find out if you already have access to Wolfram tech through your organization
×