TOPICS
Search

Cube Polynomial

The cube polynomial of a graph G is a polynomial

C_G(x)=sum_(k=1)^nc_k(G)x^k

which gives the numbers c_k(G) of induced subgraphs of G that are isomorphic to the hypercube graph Q_k.

For any graph G, c_0(G) is simple the vertex count |V(G)| and c_1(G) is the edge count |E(G)|.

See also

Connected Induced Subgraph Polynomial, Hypercube Graph, Vertex-Induced Subgraph

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Cube Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CubePolynomial.html