A Note on the Dimensionality of Modified Knödel Graphs
Jean‐Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stéphane Pérennès · International Journal of Foundations of Computer Science · 1997
We show that the edges of the modified Knödel graph can be grouped into dimensions which are similar to the dimensions of hypercubes. In particular, routing, broadcasting and gossiping, can be done easily in modified Knödel graphs using these dimensions.