An alternative formula for the number of Euler trails for a class of digraphs (Q1918565): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5808057 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5509277 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Density of states of random Schrödinger operators with a uniform magnetic field / rank | |||
Normal rank | |||
Revision as of 13:31, 24 May 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
