Distributions on graphs and walks (Q2780949)

The author proves the following results:NEWLINENEWLINENEWLINETheorem 1. Let \(G\) be a connected graph and \(D\) be a \(\text{mod }n\) distribution on \(G\). Let \(u_0\) and \(u_1\) be vertices of \(G\). If \(n> 1\) and \(G\) is not a bipartite graph, then there exists a walk \(\sigma\) on \(G\) such that \(\sigma(0)= u_0\), \(\sigma(m)=u_1\), and \(D(\sigma)= D\), where \(m\) is the length of \(\sigma\).NEWLINENEWLINENEWLINETheorem 2. Let \(D\) be a \(\text{mod }n\) distribution on a connected bipartite graph \(G\) with \(n>1\). Let \(u_0\) and \(u_1\) be vertices of \(G\). If \(u_0\) and \(u_1\) are in the same part \(V_k(G)\) and \(S(D)\equiv 0\pmod n\), then there exists a walk \(\sigma\) such that \(\sigma(0)= u_0\), \(\sigma(m)= u_1\), and \(D(\sigma)= D\), where \(m\) is the length of \(\sigma\). If \(u_k\) is in \(V_k(G)\) for each \(k= 0,1\), and \(S(D)\equiv 1\pmod n\), then there exists a walk \(\sigma\) such that \(\sigma(0)= u_0\), \(\sigma(m)= u_1\) and \(D(\sigma)= D\), where \(m\) is the length of \(\sigma\).