summary:By a ternary structure we mean an ordered pair $(U_0, T_0)$, where $U_0$ is a finite nonempty set and $T_0$ is a ternary relation on $U_0$. A ternary structure $(U_0, T_0)$ is called here a directed geodetic structure if there exists a strong digraph $D$ with the properties that $V(D) = U_0$ and \[ T_0(u, v, w)\quad \text{if} \text{and} \text{only} \text{if}\quad d_D(u, v) + d_D(v, w) = d_D(u, w) \] for all $u, v, w \in U_0$, where $d_D$ denotes the (directed) distance function in $D$. It is proved in this paper that there exists no sentence ${\mathbf s}$ of the language of the first-order logic such that a ternary structure is a directed geodetic structure if and only if it satisfies ${\mathbf s}$
We consider finite and simple digraphs. Usually, we use G to denote a graph and D to a digraph. Unde...
AbstractLet D=(V,A) be a complete directed graph (digraph) with a positive real weight function d:A→...
summary:Circular distance $d^\circ(x,y)$ between two vertices $x$, $y$ of a strongly connected direc...
summary:By a ternary structure we mean an ordered pair $(U_0, T_0)$, where $U_0$ is a finite nonempt...
summary:For a nonempty set $S$ of vertices in a strong digraph $D$, the strong distance $d(S)$ is th...
summary:We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (witho...
summary:By a ternary structure we mean an ordered pair $(X_0, T_0)$, where $X_0$ is a finite nonempt...
In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc fr...
AbstractA digraph G = (V, E) with diameter D is said to be s-geodetic, for 1 ⩽ s ⩽ D, if between any...
summary:The (directed) distance from a vertex $u$ to a vertex $v$ in a strong digraph $D$ is the len...
For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices...
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily di...
Abstract. By a ternary structure we mean an ordered pair (X0,T0), where X0 is a finite nonempty set ...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices l...
We consider finite and simple digraphs. Usually, we use G to denote a graph and D to a digraph. Unde...
AbstractLet D=(V,A) be a complete directed graph (digraph) with a positive real weight function d:A→...
summary:Circular distance $d^\circ(x,y)$ between two vertices $x$, $y$ of a strongly connected direc...
summary:By a ternary structure we mean an ordered pair $(U_0, T_0)$, where $U_0$ is a finite nonempt...
summary:For a nonempty set $S$ of vertices in a strong digraph $D$, the strong distance $d(S)$ is th...
summary:We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (witho...
summary:By a ternary structure we mean an ordered pair $(X_0, T_0)$, where $X_0$ is a finite nonempt...
In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc fr...
AbstractA digraph G = (V, E) with diameter D is said to be s-geodetic, for 1 ⩽ s ⩽ D, if between any...
summary:The (directed) distance from a vertex $u$ to a vertex $v$ in a strong digraph $D$ is the len...
For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices...
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily di...
Abstract. By a ternary structure we mean an ordered pair (X0,T0), where X0 is a finite nonempty set ...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices l...
We consider finite and simple digraphs. Usually, we use G to denote a graph and D to a digraph. Unde...
AbstractLet D=(V,A) be a complete directed graph (digraph) with a positive real weight function d:A→...
summary:Circular distance $d^\circ(x,y)$ between two vertices $x$, $y$ of a strongly connected direc...