graph distance (Q2670): Difference between revisions
Jump to navigation
Jump to search
Created a new Item: graph distance, in graph theory, the minimum number of edges in a path connecting two vertices |
Created claim: subclass of (P1): metric function (Q1531) |
||
| (One intermediate revision by the same user not shown) | |||
| Property / instance of | |||
| Property / instance of: metric function / rank | |||
Normal rank | |||
| Property / subclass of | |||
| Property / subclass of: metric function / rank | |||
Normal rank | |||
| Property / subclass of: metric function / qualifier | |||
Latest revision as of 22:19, 12 February 2023
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 |
|