A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof (Q4678083)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof |
scientific article; zbMATH DE number 2170610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof |
scientific article; zbMATH DE number 2170610 |
Statements
A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof (English)
0 references
23 May 2005
0 references
Stokes theorem
0 references
divergence formula
0 references
characterization
0 references
0.8311229944229126
0 references
0.6991523504257202
0 references
0.6941373944282532
0 references
0.6868796944618225
0 references
