On the cover polynomial of a digraph
The authors give a recursive definition of what they call the cover polynomial \(C(D; x, y)\) of a directed graph \(D\). They develop several relations for this polynomial and show that although it is not exactly the directed analogue of the Tutte polynomial, it does have a number of similar properties.
scientific article; zbMATH DE number 839126