Isometric embeddings in Hamming graphs
Journal of Combinatorial Theory Series B
On scale embeddings of graphs into hypercubes
European Journal of Combinatorics
A note on l1-rigid planar graphs
European Journal of Combinatorics - Special issue on discrete metric spaces
On the complexity of recognizing Hamming graphs and related classes of graphs
European Journal of Combinatorics - Special issue on discrete metric spaces
Clin d'oeil on L1-embeddable planar graphs
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Fiber-complemented graphs — I: structure and invariant subgraphs
Discrete Mathematics
Partial hamming graphs and expansion procedures
Discrete Mathematics
On the natural imprint function of a graph
European Journal of Combinatorics
Geometry of Cuts and Metrics
Hamming polynomials and their partial derivatives
European Journal of Combinatorics
Subdivided graphs as isometric subgraphs of Hamming graphs
European Journal of Combinatorics
Embeddability of open-ended carbon nanotubes in hypercubes
Computational Geometry: Theory and Applications
Calculating the edge Wiener and edge Szeged indices of graphs
Journal of Computational and Applied Mathematics
Hamming dimension of a graph-The case of Sierpiński graphs
European Journal of Combinatorics
Wiener index in weighted graphs via unification of Θ*-classes
European Journal of Combinatorics
| Hi-index | 0.00 |
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.