Search Results for ""

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

An equilateral polyhedron is a polyhedron whose edges are all of equal length. Platonic solids, Archimedean solids, canonical antiprisms, and canonical prisms, Johnson ...

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 prismatoid having planar sides and the same number of vertices in both of its parallel planes. The faces of a prismoid are therefore either trapezoids or parallelograms. ...

The square antiprism is the antiprism with square bases whose dual is the tetragonal trapezohedron. The square antiprism has 10 faces. The square antiprism with unit edge ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...