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

We add a fixed number of vertices of degree 1 to each vertex from one part of a bipartite graph. We study characteristic, matching and some related polynomials for graphs obtained in this way.

We investigate the extension of the nonparametric regression technique of local polynomial fitting with a kernel weight to generalized linear models and quasi-likelihood contexts. In the ordinary ...

The graph polynomial of a Feynman diagram is defined in terms of the spanning trees and forests of the underlying graph.