2 research outputs found
On arc reversal in balanced digraphs
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary. We prove that any arc reversal in a balanced multidigraph without loops decreases the number of closed walks. This also proves that arc reversal in a simple balanced digraph decreases the number of closed walks