Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Finally, we conclude by discussing the domination polynomials of a related family of graphs, the 𝑛-book graphs 𝐵𝑛, formed by joining 𝑛 copies of the cycle graph 𝐶₄ with a common edge. The journal ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...