Change search
ReferencesLink to record
Permanent link

Direct link
On the number of Euler trails in directed graphs
2002 (English)In: Mathematica Scandinavica, ISSN 0025-5521, Vol. 90, no 2, 191-214 p.Article in journal (Refereed) Published
Abstract [en]

Let G be an Eulerian digraph with all in- and out-degrees equal to 2, and let pi be an Euler trail in G. We consider an intersection matrix L(pi) with the property that the determinant of L(pi) + I is equal to the number of Euler trails in G; I denotes the identity matrix. We show that if the inverse of L(pi) exists, then L-1 (pi) = L(sigma) for a certain Euler trail sigma in G. Furthermore, we use properties of the intersection matrix to prove some results about how to divide the set of Euler trails in a digraph into smaller sets of the same size.

Place, publisher, year, edition, pages
2002. Vol. 90, no 2, 191-214 p.
Keyword [en]
digraphs, formula
URN: urn:nbn:se:kth:diva-21736ISI: 000176987500003OAI: diva2:340434
QC 20100525Available from: 2010-08-10 Created: 2010-08-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jonsson, Jakob
In the same journal
Mathematica Scandinavica

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 18 hits
ReferencesLink to record
Permanent link

Direct link