A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 東北大学の論文

著者

• Oshikiri Gen-ichi

  Faculty Of Education Iwate University

関連論文

• A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof
• A divergence-like characterization of admissible functions on digraphs

スポンサーリンク