An alternative formula for the number of Euler trails for a class of digraphs (Q1918565): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127121021, #quickstatements; #temporary_batch_1721947978549 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127121021 / rank | |||
Normal rank | |||
Latest revision as of 01:04, 26 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative formula for the number of Euler trails for a class of digraphs |
scientific article |
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
