On the cover polynomial of a digraph (Q1907103)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the cover polynomial of a digraph |
scientific article; zbMATH DE number 839126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the cover polynomial of a digraph |
scientific article; zbMATH DE number 839126 |
Statements
On the cover polynomial of a digraph (English)
0 references
5 June 1996
0 references
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.
0 references
digraph
0 references
cover polynomial
0 references
Tutte polynomial
0 references
