TOPICS
Search

Search Results for ""


1251 - 1260 of 13135 for Book GraphSearch Results
A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...
A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...
Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.
The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...
The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.
A tree spread in which each node has a finite number of children.
A theory of Hamiltonian cycles.
A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.
The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...
1 ... 123|124|125|126|127|128|129 ... 1314 Previous Next

...