A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof
From MaRDI portal
Publication:4678083
DOI10.4036/IIS.2004.165zbMath1066.05070OpenAlexW2045574879MaRDI QIDQ4678083
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
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
This page was built for publication: A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof