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 present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that ...

For a connected graph G, the Schultz and modified Schultz polynomials, introduced by I. Gutman: Some relations between distance-based polynomials of trees. Bulletin, Classe des Sciences Mathématiques ...