The number of shortest paths in the arrangement graph (Q497229)
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: The number of shortest paths in the arrangement graph |
scientific article; zbMATH DE number 6484704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of shortest paths in the arrangement graph |
scientific article; zbMATH DE number 6484704 |
Statements
The number of shortest paths in the arrangement graph (English)
0 references
23 September 2015
0 references
shortest path
0 references
minimum factorization of a permutation
0 references
arrangement graph
0 references
bi-colored tree
0 references
interconnection network
0 references
0 references
