graph distance (Q2670)

From Azupedia
Revision as of 22:18, 12 February 2023 by Fire (talk | contribs) (‎Created a new Item: graph distance, in graph theory, the minimum number of edges in a path connecting two vertices)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
in graph theory, the minimum number of edges in a path connecting two vertices
  • geodetic distance
  • distance
Language Label Description Also known as
English
graph distance
in graph theory, the minimum number of edges in a path connecting two vertices
  • geodetic distance
  • distance

Statements

 
    Retrieved from "https://wiki.tiffa.net/w/index.php?title=Item:Q2670&oldid=13480"