Self-Complementary Graphs(mathworld.wolfram.com)3 points·by lorenzohess·2 เดือนที่ผ่านมา·1 commentsmathworld.wolfram.comSelf-Complementary Graphshttps://mathworld.wolfram.com/Self-ComplementaryGraph.html1 commentsPost comment[–]lorenzohess·2 เดือนที่ผ่านมาreply> A self-complementary graph is a graph which is isomorphic to its graph complement.i.e., if you add edges between nodes which aren't connected, and remove edges which are already there, you get back the graph you started with.
i.e., if you add edges between nodes which aren't connected, and remove edges which are already there, you get back the graph you started with.