Cube Polynomial
The cube polynomial, perhaps more explicitly called the hypercube polynomial, of a graph G is a polynomial
which encodes the numbers c_k(G) of induced subgraphs of G that are isomorphic to the hypercube graph Q_k.
The total
For any graph G, c_0(G) is simply 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 SubgraphExplore with Wolfram|Alpha
WolframAlpha
References
Brešar, B.; Klavžar, S.; and Škrekovski, R. "The Cube Polynomial and its Derivatives: The Case of Median Graphs." Elec. J. Combin. 10, #R3, 2003.Klavžar, S. and Mollard, M. "Cube Polynomial of Fibonacci and Lucas Cubes." Acta Appl. Math. 117, 93-105, 2012.Xie, Y.-T.; Feng, Y.-D.; and Xu, S.-J. "A Relation Between the Cube Polynomials of Partial Cubes and the Clique Polynomials of Their Crossing Graphs." 26 Mar 2023. https://arxiv.org/abs/2303.14671.Cite this as:
Weisstein, Eric W. "Cube Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CubePolynomial.html