A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak (Q2910932)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak |
scientific article; zbMATH DE number 6081278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak |
scientific article; zbMATH DE number 6081278 |
Statements
12 September 2012
0 references
distance matrix
0 references
hypertrees, isometric embedding
0 references
0.87694556
0 references
0.8671304
0 references
0.8572695
0 references
0.85470235
0 references
0.85433614
0 references
0 references
A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak (English)
0 references
