The precise number of nodes needed to locate all others in octahedral tile networks is found.

Imagine a network where you want to identify every single spot using distances to a few landmark points. A landmark set that gives every spot a unique address is called a resolving setresolving setA set of vertices whose distances to every other vertex are all different, so you can identify each vertex by its distances to the set.. If it still works even when one landmark fails, it is fault-tolerant. Researchers studied four infinite families of network grids built from eight-sided octahedral shapes: HT^1(n), HT^2(n), RT^1(m,n), and RT^2(m,n). They found pairs of twin spots that look identical and showed that picking landmark points along the boundaries of these twin pairs uniquely locates every vertex. This let them calculate exact landmark counts. Because every twin pair has exactly two spots, the fault-tolerant landmark count is always exactly twice the regular count for all four network families.

Why it matters

These results give exact formulas for the minimum number of 'sensors' needed to uniquely identify every vertex in octahedral tiling networks. This matters for network navigation and fault detection in structures that repeat like tiles. Because the formulas work for four infinite families, they apply to arbitrarily large tessellations of these shapes.

Questions answered