Search Results for ""

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

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 ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...

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 ...

The conversion of a quadratic polynomial of the form ax^2+bx+c to the form a(x+b/(2a))^2+(c-(b^2)/(4a)), which, defining B=b/2a and C=c-b^2/4a, simplifies to a(x+B)^2+C.

The circles on the polygon diagonals of a complete quadrilateral as diameters are coaxal. Furthermore, the orthocenters of the four triangles of a complete quadrilateral are ...

An inner product space is a vector space together with an inner product on it. If the inner product defines a complete metric, then the inner product space is called a ...