On the cover polynomial of a digraph (Q1907103): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1995.1055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061138851 / rank | |||
Normal rank | |||
Revision as of 14:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the cover polynomial of a digraph |
scientific article |
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
