I've got discrete math 2 hw due this morning, and as i'm working on it I notice one of the questions asks me to prove a graph is self-complementary. Nowhere in the book does it define it, but in a few problems above it is ambiguously defined as "A simple graph G is called self-complementary if G and G are isomorphic" ... i know what isomorphic is, and i'm assuming there was a typo in the book and it should be "G and G' " or something, but i dunno...
can anyone find any examples or does anyone know what i'm talking about? a google search netted me no useful info 🙁
can anyone find any examples or does anyone know what i'm talking about? a google search netted me no useful info 🙁