Detour: The BEST Theorem

Given an adjacency matrix $A(G)$ of a directed Eulerian graph $G$, we define the matrix $A^∗(G)$ by replacing the i-th diagonal entry of $−A(G)$ by InDegree(i) for each node i in $G$ (the figure below).