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 ...

Zeros of Graph Polynomials and Computational Phase transitions Supervisor: Dr Viresh Patel Project description: Combinatorial counting problems have rich connections to many areas of science including ...

Inspired by Rearick's work on logarithm and exponential functions of arithmetic functions, we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving ...

The Hosoya polynomial H(G, λ) of a graph G has the property that its first derivative at λ = 1 is equal to the Wiener index. Sometime ago two distance-based graph invariants were studied - the Schultz ...