4
$\begingroup$

I came about the following graph which seems to me the smallest discrete version of the torus:

enter image description here

Is this graph treated under a special name? What can be said about its cycles? Can its cycles be grouped in some equivalence classes which can be related to homotopy classes of closed curves on the continuous torus?

enter image description here

Or are all cycles essentially the same on the discrete torus?

[Added] I came up with an even more intriguing - since more symmetric - picture of the "torus graph":

enter image description here

Maximal symmetry would be achieved only when the three vertices in the middle would coincide.

  • 0
    @Hans : Yes, I can see that. But what does that have to do with the torus?2011-09-20

2 Answers 2

6

The graph is indeed toroidal: toroidal embedding of given graph

Of course, Hans' graph also has a standard embedding too:

three by three grid

I would say that the graph which is the discrete version of the torus would be $K_7$, since it is a triangulation of the torus and also a vertex and edge transitive graph.

This is $K_7$ on the torus:

K7 on the torus

  • 0
    @Hans There is only one embedding of $K_7$ on the torus since every face must be a triangle. By "standard embedding" I was just referring to your 3 by 3 description in the comments. As you can see from the two given embeddings of your graph two embeddings of the same graph can look very different. Some more details on this topic can be found in this paper by Kocay: http://bkocay.cs.umanitoba.ca/g&g/articles/torusembeddings.pdf2011-09-21
0

I found two interesting references for the "discrete torus":

At least there is a thorough definition of the discrete torus.