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

DOI10.4036/IIS.2004.165zbMATH Open1066.05070OpenAlexW2045574879MaRDI QIDQ4678083FDOQ4678083

Authors: Gen-ichi Oshikiri 

Publication date: 23 May 2005

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2004.165

Recommendations

• A divergence-like characterization of admissible functions on digraphs
• On good characterizations for digraphs
• scientific article; zbMATH DE number 19808
• Remarks on orthogonal factorizations of digraphs
• Common root functions of two digraphs

zbMATH Keywords

characterizationStokes theoremdivergence formula

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cited In (1)

• A divergence-like characterization of admissible functions on digraphs

This page was built for publication: A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678083)