The <a href="https://en.wikipedia.org/wiki/26-fullerene_graph" class="extiw" title="en:26-fullerene graph">26-fullerene graph</a> with hexadecimal labels on its vertices. The distance between any two vertices equals half the binary Hamming distance of their labels; for instance, every two adjacent vertices (one unit apart) have labels that differ in exactly two bits.
<a href="//commons.wikimedia.org/wiki/User:David_Eppstein" class="mw-redirect" title="User:David Eppstein">David Eppstein</a>
<span class="int-own-work" lang="en">Own work</span>