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

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

We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion ...