Harary's Theorem on Signed Graphs and Reversibility of Markov Chains

Abstract

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. © 2014 Springer Science+Business Media New York.