A theorem for an axiomatic approach to metric properties of graphs. (Q4457249)

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 2061565
Language Label Description Also known as
default for all languages
No label defined
    English
    A theorem for an axiomatic approach to metric properties of graphs.
    scientific article; zbMATH DE number 2061565

      Statements

      A theorem for an axiomatic approach to metric properties of graphs (English)
      0 references
      A theorem for an axiomatic approach to metric properties of graphs. (English)
      0 references
      0 references
      21 March 2004
      0 references
      distance in a graph
      0 references
      step in a graph
      0 references
      The paper concerns an axiomatic approach to graph theory, in particular to metric properties of finite undirected graphs. A step in a graph \(G\) is an ordered triple \(uvx \in V(G) \times V(G) \times V(G)\) such that \(d_G(u,v) = 1\), \(d_G(v,x) = d_G(u,x) - 1\), where \(d_G\) is the distance in \(G\). The set of steps of \(G\) is denoted by \(S\). A subset \(M\) of \(V(G) \times V(G) \times V(G)\) is called associated with \(G\), if any two vertices \(u,v\) are adjacent in \(G\) if and only if there exists a vertex \(x\) of \(G\) such that either \(uvx \in M\), or \(vux \in M\). A system of axioms for \(M\) to be equal to \(S\) is given.
      0 references

      Identifiers