Search Results for ""

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

The tensor product of two vector spaces V and W, denoted V tensor W and also called the tensor direct product, is a way of creating a new vector space analogous to ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...

The inner Vecten circle is the circumcircle of the inner Vecten triangle. It has center at Kimberling center X_(642), which is the complement of the inner Vecten point ...

The outer Vecten circle is the circumcircle of the outer Vecten triangle. It has center at Kimberling center X_(641), which is the complement of the outer Vecten point ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...