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 ✦
A note on residue formulas for the Euler class of sphere fibrations
✍ Scribed by Francisco Gómez Ruiz
- Publisher
- Coastal and Estuarine Research Federation
- Year
- 2011
- Tongue
- English
- Weight
- 119 KB
- Volume
- 32
- Category
- Article
- ISSN
- 1860-6261
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a formula for the number of Euler tra
✍
J Lauri
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 240 KB
An alternative formula for the number of
✍
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.
Note on the drag coefficient for a spher
✍
Scott W. Hopke; John C. Slattery
📂
Article
📅
1970
🏛
American Institute of Chemical Engineers
🌐
English
⚖ 191 KB
👁 2 views
On the residue classes of integer sequen
✍
Carsten Elsner; Takao Komatsu
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 188 KB
In this paper we investigate linear three-term recurrence formulae with sequences of integers (T (n)) n 0 and (U (n)) n 0 , which are ultimately periodic modulo m, e.g. (T (n) mod m) n 0 = (a 0 , a 1 , a 2 , .
A note on the expression for the rotatio
✍
Chen Yuan-sheng
📂
Article
📅
1982
🏛
Springer
🌐
English
⚖ 188 KB
A short note on the generalized Euler tr
✍
Paul Sablonnière
📂
Article
📅
1992
🏛
Springer US
🌐
English
⚖ 441 KB