From di- + graphon. <span class="searchmatch">digraphon</span> (plural <span class="searchmatch">digraphons</span>) (mathematics) The object obtained as the limit of a convergent sequence of directed graphs....
<span class="searchmatch">digraphons</span> plural of <span class="searchmatch">digraphon</span> 2015, Diana Cai, Nathanael Ackerman, Cameron Freer, “Priors on exchangeable directed graphs”, in arXiv[1]: We construct...
or journal name)[1]: This bound almost matches the known upper bound for graphs and, in a certain sense, is the best possible for graphons. <span class="searchmatch">digraphon</span>...