Abstract: ▫$n$▫-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural ▫$n$▫-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to ▫$n$▫-ary transit functions and discuss the connectivity conditions for underlying hypergraph. Also ▫$n$▫-ary all paths transit function is considered.Keywords: mathematics, graph theory, n-arity, transit function, betweenness, Steiner convexityPublished in DKUM: 31.03.2017; Views: 28660; Downloads: 348 Full text (143,68 KB)This document has many files! More...
Keywords: ekspertni sistemi, umetna inteligenca, ekspertna lupina Arity/Expert, Arity/Prolog, programski jeziki, PASCAL, digitalna sitaPublished in DKUM: 26.07.2007; Views: 2524; Downloads: 0
Keywords: ekspertni sistemi, baze znanja, lupine, Arity/Prolog, digitalna vezja, TTL družina, CMOS družinaPublished in DKUM: 26.07.2007; Views: 2808; Downloads: 0