No label defined (Q3762341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4012647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4012647 |
Statements
1985
0 references
orientations of a graph
0 references
information polynomial
0 references
tree
0 references
0.7724782824516296
0 references
0.7484588027000427
0 references
0.7464715242385864
0 references
[For the entire collection see Zbl 0601.00003.] In connection with determining the amount of relative information contained in orientations of a graph a determinant, called the information polynomial, arises. The authors evaluate this polynomial in terms of subgraphs and obtain a recurrence relation for a certain function involving this polynomial in case the graph is a tree.
0 references