Geodesics and steps in a connected graph
A step in a connected undirected graph \(G\) is an ordered triple of vertices \((u,v,x)\) such that \(d(u,v)=1\) and \(d(u,x)=d(v,x)+1,\) where \(d\) denotes the distance. For a ternary relation \(T\) on a set \(V\) the graph \(\Gamma (V,T)\) is defined so that its vertex set is \(V\) and two vertices \(u\), \(v\) are adjacent in it if and only if there exists \(x\in V\) such that \((u,v,x) \in T\) or \((v,u,x)\in T.\) The main theorem gives a necessary and sufficient condition for a ternary relation \(T\) on \(V\) with the connected graph \(\Gamma (V,T)\) to be the set of all steps in \(\Gamma (V,T).\) This condition is formulated in the form of eight axioms. An analogous necessary and sufficient condition is stated for an ordered \(n\)-tuple (with arbitrary \(n\)) to determine a geodesic (the shortest path between two given vertices).
- A Characterization of Certain Ptolemaic Graphs
- A characterization of the interval function of a connected graph
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 617118 (Why is no real title available?)
- scientific article; zbMATH DE number 2057412 (Why is no real title available?)
- scientific article; zbMATH DE number 846953 (Why is no real title available?)
- On the set of all shortest paths of a given length in a connected graph
- Intervals and steps in a connected graph
- On Properties of a Graph that Depend on its Distance Function
- On signpost systems and connected graphs
- Signpost systems and spanning trees of graphs
- On the distance function of a connected graph
- Guides and shortcuts in graphs
- An axiomatic approach to metric properties of connected graphs.
- A theorem for an axiomatic approach to metric properties of graphs.
- An algebraic characterization of geodetic graphs
- A new proof of a characterization of the set of all geodesics in a connected graph
- scientific article; zbMATH DE number 1842910 (Why is no real title available?)
- The directed geodetic structure of a strong digraph.
- scientific article; zbMATH DE number 908782 (Why is no real title available?)
- The connected graphs obtained from finite projective planes
- Geodesic Walks in Polytopes
- On transit functions in weighted graphs
- scientific article; zbMATH DE number 2230250 (Why is no real title available?)
- Median geometry and applications. Abstracts from the workshop held February 15--20, 2026
- Distance-hereditary graphs and signpost systems
This page was built for publication: Geodesics and steps in a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209985)