back to table · edit · history · where entries came from · files
formula-line-graph: The matching-generating polynomial $M(G,x)$ of a graph $G$ equals $I(L(G),x)$, where $L(G)$ is the line graph and $M(G,x)$ is the generating form- in HREF{T248}[the matching-generating polynomial table].+ of the matching polynomial. formula-paths: For the path graph $P_n$, $I(P_n,x)=x^{(n+1)/2}F_{n+2}(x^{-1/2})$, where $F_n$ is the HREF{Fibonacci_polynomials}[Fibonacci polynomial] with $F_0=0$
print(G.complement().clique_polynomial())' Similar tables:-- table: HREF{T248}[Matching-generating polynomials of connected graphs]- relation: the matching-generating polynomial $M(G,x)$ is the independence polynomial- of the line graph $L(G)$ - table: HREF{Entropy_constants_of_lattice_models}[Entropy constants of lattice models] relation: the hard-core constants are $\lim I(\Lambda,1)^{1/|\Lambda|}$ over finite
Sign in to restore an earlier version.
