Search Results for ""
391 - 400 of 497 for Complement LawSearch Results
Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...
Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...
A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...
The Fuhrmann triangle of a reference triangle DeltaABC is the triangle DeltaF_CF_BF_A formed by reflecting the mid-arc points arcM_A, arcM_B, arcM_C about the lines AB, AC, ...
For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...
A theorem outlined by Kolmogorov (1954) which was subsequently proved in the 1960s by Arnol'd (1963) and Moser (1962; Tabor 1989, p. 105). It gives conditions under which ...
A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...
The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...
Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...
A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...
...
View search results from all Wolfram sites (4566 matches)

