Search Results for ""

A perimeter-bisecting segment of a polygon originating from the midpoint of one side. Each cleaver M_1C_1, M_2C_2, and M_3C_3 in a triangle DeltaA_1A_2A_3 is parallel to an ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

Efron's dice are set of four nontransitive dice such that the probabilities of A winning against B, B against C, C against D, and D against A are all the same. The images ...

The elongated pentagonal orthobirotunda is a convex equilateral orthobirotunda having regular pentagonal upper and lower rotundas arranged symmetrically with respect to each ...

An enneahedron, also called a nonahedron, is a nine-faced polyhedron. The term "enneahedron" is generally preferred over "nonahedron" since while the former combines the ...

The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...