A word is a graph where each vertex is a letter and each edge is a connection between letters.
-
-
Replying to @DeityOfReligion
Vertices = {D, O, R, W} Edges = {(W, O), (O, R), (R, D)} W-O-R-D
2 replies 0 retweets 2 likes -
Replying to @DeityOfReligion
@DeityOfReligion Aren't bana and banana the same graph? Can you have duplicate edges? Is the set of edges ordered?1 reply 0 retweets 1 like
Replying to @robertskmiles
@robertskmiles Will have to use subscripts to indicate duplicate letters (A_1, A_2, etc.). Can be written backwards, forwards—not scrambled
4:12 PM - 10 Oct 2015
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.