Harary's theorem on signed graphs and reversibility of Markov chains

A counterpart of the well-known Harary theorem on signed graphs is proved for digraphs over groups. This result is then used to derive a known theorem on the diagonal similarity of matrices and Kolmogorov's criterion of the reversibility of Markov chains.