Algebraic integers as chromatic and domination roots (Q446327): Difference between revisions

Summary: Let \(G\) be a simple graph of order \(n\) and \(\lambda \in \mathbb{N}\). A mapping \(f : V(G) \rightarrow \{1,2,\dots,\lambda\}\) is called a \(\lambda\)-colouring of \(G\) if \(f(u) \neq f(v)\) whenever the vertices \(u\) and \(v\) are adjacent in \(G\). The number of distinct \(\lambda\)-colourings of \(G\), denoted by \(P(G,\lambda)\), is called the chromatic polynomial of \(G\). The domination polynomial of \(G\) is the polynomial \(D(G,\lambda) = \sum^n_{i=1} d(G,i)\lambda^i\), where \(d(G,i)\) is the number of dominating sets of \(G\) of size \(i\). Every root of \(P(G,\lambda)\) and \(D(G,\lambda)\) is called the chromatic root and the domination root of \(G\), respectively. Since chromatic polynomial and domination polynomial are monic polynomial with integer coefficients, its zeros are algebraic integers. This naturally raises the question: which algebraic integers can occur as zeros of chromatic and domination polynomials? In this paper, we state some properties of this kind of algebraic integers.