Gray Code & Graph 64

This week, we studied Graph 64 from The Foster Census and applied a gray code to it’s vertices.

Since Graph 64 is based on a Hamilton cycle, we next compared each vertex to the third vertex (besides it’s two neighbors in the Hamilton cycle) that it is connected to. Our goal was to see if there is a pattern that exists between the intersection and differences of the two gray codes. Unfortunately, we did not find a correlation.

  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: