An alternative formula for the number of Euler trails for a class of digraphs

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.