graph distance (Q2927)

From MaRDI portal
Revision as of 16:46, 29 July 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Q2742711
0 references