wait if A is a graph and B is a graph then each vertex c in V(AxB) is a pair (a,b) with a in V(A) and b in V(B) but then what about the edges ? so if i have c = (a,b) and c'=(a',b') then (c,c') is an edge iff a=a' or b=b' ? it is harder to visualize than normal graphs 
i may have time to watch the video. how long is it, GSSD? Do we have A is a rank and B is a file (that would be a little dumb!) or A are the pieces with whether they can capture and B is the future move counter? my mind gets very confused!! i am sorry i did not watch the video yet! I might soon watch it
Cartesian Products of Graphs
Sort:
Hello everybody. Today I'd like to share with you a video on a really important graph operation, the Cartesian Product of Graphs. It's actually going to lead into some chess-related math topics in my next few videos. Hope you like it.
https://youtu.be/c6LR9B2idQk