{"version":"1.0","type":"link","title":"Self-complementary graph - Newikis","description":"In the mathematical field of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the 4-vertex path graph and the 5-vertex cycle graph.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/e/e8/Self-complementary_NZ_graph.svg/1280px-Self-complementary_NZ_graph.svg.png","thumbnail_width":1280,"thumbnail_height":1280}