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

Access this Article

Search this Article

Author(s)

Abstract

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.

Journal

  • Interdisciplinary Information Sciences

    Interdisciplinary Information Sciences 10(2), 165-167, 2004

    Graduate School of Information Sciences, Tohoku University

Codes

  • NII Article ID (NAID)
    110001065896
  • NII NACSIS-CAT ID (NCID)
    AA11032627
  • Text Lang
    ENG
  • Article Type
    departmental bulletin paper
  • ISSN
    1340-9050
  • Data Source
    NII-ELS  IR  J-STAGE 
Page Top