A note on the total number of double Eulerian circuits in multigraphs
J. Integer Seq. 5(2), Art. 02.2.5, 3 p., electronic only (2002)
Summary
Summary: We formulate explicitly and discuss a simple new enumerative formula for double (directed) eulerian circuits in $n$-edged labeled multigraphs. The formula follows easily from a recent 2-parametric formula of B. Lass.
Mathematics Subject Classification
05C30, 05C45
Keywords/Phrases
double Eulerian circuit, symmetric multidigraph, labeled vertices, root (Concerned with sequences and
