chromatic_polynomial#
- chromatic_polynomial(G)[source]#
Returns the chromatic polynomial of
G
This function computes the chromatic polynomial via an iterative version of the deletion-contraction algorithm.
The chromatic polynomial
X_G(x)
is a fundamental graph polynomial invariant in one variable. EvaluatingX_G(k)
for an natural numberk
enumerates the proper k-colorings ofG
.There are several equivalent definitions; here are three:
Def 1 (explicit formula): For
G
an undirected graph,c(G)
the number of connected components ofG
,E
the edge set ofG
, andG(S)
the spanning subgraph ofG
with edge setS
[1]:\[X_G(x) = \sum_{S \subseteq E} (-1)^{|S|} x^{c(G(S))}\]Def 2 (interpolating polynomial): For
G
an undirected graph,n(G)
the number of vertices ofG
,k_0 = 0
, andk_i
the number of distinct ways to color the vertices ofG
withi
unique colors (fori
a natural number at mostn(G)
),X_G(x)
is the unique Lagrange interpolating polynomial of degreen(G)
through the points(0, k_0), (1, k_1), dots, (n(G), k_{n(G)})
[2].Def 3 (chromatic recurrence): For
G
an undirected graph,G-e
the graph obtained fromG
by deleting edgee
,G/e
the graph obtained fromG
by contracting edgee
,n(G)
the number of vertices ofG
, ande(G)
the number of edges ofG
[3]:\[\begin{split}X_G(x) = \begin{cases} x^{n(G)}, & \text{if $e(G)=0$} \\ X_{G-e}(x) - X_{G/e}(x), & \text{otherwise, for an arbitrary edge $e$} \end{cases}\end{split}\]This formulation is also known as the Fundamental Reduction Theorem [4].
- Parameters:
- GNetworkX graph
- Returns:
- instance of
sympy.core.add.Add
A Sympy expression representing the chromatic polynomial for
G
.
- instance of
Notes
Interpretation of the coefficients is discussed in [5]. Several special cases are listed in [2].
The chromatic polynomial is a specialization of the Tutte polynomial; in particular,
X_G(x) = `T_G(x, 0)
[6].The chromatic polynomial may take negative arguments, though evaluations may not have chromatic interpretations. For instance,
X_G(-1)
enumerates the acyclic orientations ofG
[7].References
[1]D. B. West, â€śIntroduction to Graph Theory,â€ť p. 222
[2] (1,2)E. W. Weisstein â€śChromatic Polynomialâ€ť MathWorldâ€“A Wolfram Web Resource https://mathworld.wolfram.com/ChromaticPolynomial.html
[3]D. B. West, â€śIntroduction to Graph Theory,â€ť p. 221
[4]J. Zhang, J. Goodall, â€śAn Introduction to Chromatic Polynomialsâ€ť https://math.mit.edu/~apost/courses/18.204_2018/Julie_Zhang_paper.pdf
[5]R. C. Read, â€śAn Introduction to Chromatic Polynomialsâ€ť Journal of Combinatorial Theory, 1968 https://math.berkeley.edu/~mrklug/ReadChromatic.pdf
[6]W. T. Tutte, â€śGraph-polynomialsâ€ť Advances in Applied Mathematics, 2004 https://www.sciencedirect.com/science/article/pii/S0196885803000411
[7]R. P. Stanley, â€śAcyclic orientations of graphsâ€ť Discrete Mathematics, 2006 https://math.mit.edu/~rstan/pubs/pubfiles/18.pdf
Examples
>>> C = nx.cycle_graph(5) >>> nx.chromatic_polynomial(C) x**5 - 5*x**4 + 10*x**3 - 10*x**2 + 4*x
>>> G = nx.complete_graph(4) >>> nx.chromatic_polynomial(G) x**4 - 6*x**3 + 11*x**2 - 6*x