Relevant? Sort of. Funny? YES!

http://xkcd.com/403/

And don't forget to read the ALT-text (hold your mouse over it for a few seconds), it references a discussion we had in the first week of class!

I guess a symmetric graph is cool because "the graph maps onto itself while preserving edge-vertex connectivity." But apparently, these are pretty rare because according to Wikipedia:

The proportion of graphs on n vertices with nontrivial automorphism tends to zero as n grows, which is informally expressed as "almost all graphs are asymmetric".[1]

Guess this guy deserves to get lucky.

1. "Algebraic Graph Theory", by Christopher David Godsil, Gordon Royle (2001) ISBN 0387952209