The directed geodetic structure of a strong digraph
Czechoslovak Mathematical Journal (2004)
- Volume: 54, Issue: 1, page 1-8
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topNebeský, Ladislav. "The directed geodetic structure of a strong digraph." Czechoslovak Mathematical Journal 54.1 (2004): 1-8. <http://eudml.org/doc/30834>.
@article{Nebeský2004,
abstract = {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\}\}$.},
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {strong digraph; directed distance; ternary relation; finite structure; strong digraph; directed distance; ternary relation; finite structure},
language = {eng},
number = {1},
pages = {1-8},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {The directed geodetic structure of a strong digraph},
url = {http://eudml.org/doc/30834},
volume = {54},
year = {2004},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - The directed geodetic structure of a strong digraph
JO - Czechoslovak Mathematical Journal
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 54
IS - 1
SP - 1
EP - 8
AB - 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}}$.
LA - eng
KW - strong digraph; directed distance; ternary relation; finite structure; strong digraph; directed distance; ternary relation; finite structure
UR - http://eudml.org/doc/30834
ER -
References
top- Graphs & Digraphs, Chapman & Hall, London, 1996. (1996) MR1408678
- Finite Model Theory, Springer-Verlag, Berlin, 1995. (1995) MR1409813
- The interval function of a graph, Math. Centre Tracts 132, Math Centre, Amsterdam, 1980. (1980) Zbl0446.05039MR0605838
- A characterization of the interval function of a connected graph, Czechoslovak Math. J. 44(119) (1994), 173–178. (1994) MR1257943
- Characterizing the interval function of a connected graph, Math. Bohem. 123 (1998), 137–144. (1998) MR1673965
- The interval function of a connected graph and a characterization of geodetic graphs, Math. Bohem. 126 (2001), 247–254. (2001) MR1826487
- The induced paths in a connected graph and a ternary relation determined by them, Math. Bohem. 127 (2002), 397–408. (2002) MR1931324
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.