| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654963 | European Journal of Combinatorics | 2006 | 6 Pages |
Abstract
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometric subgraphs of Hamming graphs. This approach simplifies recognition of these graphs and computation of their average distance.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sandi Klavžar,