Search Results for ""

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...

A polynomial is called logarithmically concave (or log-concave) if the sequence of its coefficients is logarithmically concave. If P(x) is log-convex and Q(x) is unimodal, ...

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.