Search Results for ""

In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...

The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...

A transformation which is one-to-one and a surjection (i.e., "onto").

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

A robust nonparametric test which is an alternative to the paired t-test. This test makes the basic assumption that there is information only in the signs of the differences ...

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

A collection of equations satisfies the Hasse principle if, whenever one of the equations has solutions in R and all the Q_p, then the equations have solutions in the ...

A similarity transformation which preserves orientation, also called a homothety.

Two variates A and B are statistically independent iff the conditional probability P(A|B) of A given B satisfies P(A|B)=P(A), (1) in which case the probability of A and B is ...

The L^2-inner product of two real functions f and g on a measure space X with respect to the measure mu is given by <f,g>_(L^2)=int_Xfgdmu, sometimes also called the bracket ...