On the cover polynomial of a digraph (Q1907103): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Fan R. K. Chung / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
Revision as of 19:42, 9 February 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
