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
A transit function R on a set V is a function R: V × V → 2V satisfying the axiom
AbstractIn the present paper, the concept of n-ary and finitary connectedness is introduced, where 1...
AbstractThe induced path interval J(u,v) consists of the vertices on the induced paths between u and...
n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We s...
▫$n$▫-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. ...
textabstractThe notion of transit function is introduced to present a unifying approach for results ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
AbstractThe geodesic and induced path transit functions are the two well-studied interval functions ...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Definition(s): A transit function on a set V is a function R:V ×V → 2V satisfying the following axio...
We introduce a notion of N-connectedness of a topological space with respect to a convexity on this ...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Let G be a connected graph on V. A subset X of V is all-paths convex or ap-convex if X contains eac...
A transit function R on a set V is a function R: V × V → 2V satisfying the axiom
AbstractIn the present paper, the concept of n-ary and finitary connectedness is introduced, where 1...
AbstractThe induced path interval J(u,v) consists of the vertices on the induced paths between u and...
n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We s...
▫$n$▫-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. ...
textabstractThe notion of transit function is introduced to present a unifying approach for results ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
AbstractThe geodesic and induced path transit functions are the two well-studied interval functions ...
AbstractA feasible family of paths in a connected graph G is a family that contains at least one pat...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Definition(s): A transit function on a set V is a function R:V ×V → 2V satisfying the following axio...
We introduce a notion of N-connectedness of a topological space with respect to a convexity on this ...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Let G be a connected graph on V. A subset X of V is all-paths convex or ap-convex if X contains eac...
A transit function R on a set V is a function R: V × V → 2V satisfying the axiom
AbstractIn the present paper, the concept of n-ary and finitary connectedness is introduced, where 1...
AbstractThe induced path interval J(u,v) consists of the vertices on the induced paths between u and...