On the minimum distance in a \(k\)-vertex set in a graph (Q2009525)
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 7138602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum distance in a \(k\)-vertex set in a graph |
scientific article; zbMATH DE number 7138602 |
Statements
On the minimum distance in a \(k\)-vertex set in a graph (English)
0 references
29 November 2019
0 references
distance
0 references
\(k\)-subset of vertices
0 references
graph
0 references
0.7912214994430542
0 references
0.7780816555023193
0 references
0.7747204899787903
0 references
0.7734596729278564
0 references
0.7725193500518799
0 references
