A new proof of a characterization of the set of all geodesics in a connected graph (Q4515341)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1528779
Language Label Description Also known as
default for all languages
No label defined
    English
    A new proof of a characterization of the set of all geodesics in a connected graph
    scientific article; zbMATH DE number 1528779

      Statements

      A new proof of a characterization of the set of all geodesics in a connected graph (English)
      0 references
      0 references
      13 November 2000
      0 references
      path
      0 references
      geodesic
      0 references
      distance
      0 references
      connected graph
      0 references
      A geodesic in an undirected graph \(G\) is a shortest path between two vertices in \(G\), i.e. a path in \(G\) whose length is equal to the distance between its terminal vertices in \(G\). In one of his preceding papers (see Zbl 0949.05022 below) the author proved a theorem which gives necessary and sufficient conditions for a set of paths in a connected graph \(G\) to be a set of geodesics in \(G\). It may be said that this theorem gives a certain axiomatics for geodesics in a graph and thus for the structure of a graph in general. The proof seemed to the author too long and thus in the present paper he presents the same theorem with a new and shorter proof.
      0 references

      Identifiers