An alternative formula for the number of Euler trails for a class of digraphs (Q1918565)
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 906914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An alternative formula for the number of Euler trails for a class of digraphs |
scientific article; zbMATH DE number 906914 |
Statements
An alternative formula for the number of Euler trails for a class of digraphs (English)
0 references
18 July 1996
0 references
The number of Euler trails for a very special class of digraphs (in which all in- and out-degrees are equal to two) is expressed in the form of a determinant.
0 references
Euler trails
0 references
digraphs
0 references
0.97304046
0 references
0.89645237
0 references
0.86587495
0 references
0.8563529
0 references
