graph distance (Q2742711)

From Wikidata
Jump to navigation Jump to search
in graph theory, the minimum number of edges in a path connecting two vertices
  • geodetic distance
  • distance
edit
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

Identifiers