Search Results for ""

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

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

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

The above topological structure, composed of a countable union of compact sets, is called Alexander's horned sphere. It is homeomorphic with the ball B^3, and its boundary is ...

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

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...