In previous papers, the author defined a notion of admissible functions on digraphs, studied its properties, and gave a divergence-like characterization of admissible functions on digraphs from the view point of foliated theory. In this paper, we give a purely combinatorial proof of the characterization of admissible functions on digraphs.
