Search Results for ""

The circumcenter is the center O of a triangle's circumcircle. It can be found as the intersection of the perpendicular bisectors. The trilinear coordinates of the ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...