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.
✦ LIBER ✦
An alternative formula for the number of Euler trails for a class of digraphs
✍ Scribed by N. Macris; J.V. Pulé
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 250 KB
- Volume
- 154
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
On a formula for the number of Euler tra
✍
J Lauri
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 240 KB
An index formula for the relative class
✍
Kurt Girstmair
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 520 KB
On an index formula for the relative cla
✍
Akira Endô
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 218 KB
An inversion formula for a class of inte
✍
C Nasim
📂
Article
📅
1975
🏛
Elsevier Science
🌐
English
⚖ 438 KB
Determinantal Formula for the Cuspidal C
✍
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.
A formula for the number of Latin square
✍
Jia-yu Shao; Wan-di Wei
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 186 KB