Source: wikibot/self-complementary-graph
= Self-complementary graph
{wiki=Self-complementary_graph}
A self-complementary graph is a type of graph that is isomorphic to its own complement. In graph theory, for a given graph \\( G \\), the complement graph \\( \\overline\{G\} \\) is formed by taking the same vertex set as \\( G \\) but including only those edges that are not present in \\( G \\).