𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a formula for the number of Euler trails for a class of digraphs

✍ Scribed by J Lauri

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
240 KB
Volume
163
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this note we give an elementary combinatorial proof of a formula of Macris and Pul6 for the number of Euler trails in a digraph all of whose vertices have in-degree and out-degree equal to2.

πŸ“œ SIMILAR VOLUMES

An alternative formula for the number of
An alternative formula for the number of Euler trails for a class of digraphs
✍ N. Macris; J.V. PulΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 250 KB

We derive an alternative formula for the number of Euler trails on strongly connected directed pseudographs whose every vertex has outdegree and indegree both equal to two in terms of an intersection matrix.

Determinantal Formula for the Cuspidal C
Determinantal Formula for the Cuspidal Class Number of the Modular CurveX1(m)
✍ Fumio Hazama πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 313 KB

An integer matrix whose determinant computes the cuspidal class number of the modular curve X 1 (m) is obtained. When m is an odd prime, this will provide us with an upper bound of the class number.