4. Let G be a simple graph with n vertices. Its complement is the simple graph with the same vertex set and two vertices
Posted: Thu May 12, 2022 12:54 pm
4. Let G be a simple graph with n vertices. Its complement is the simple graph with the same vertex set and two vertices are adjacent in G ̄ if and only if they are not adjacent in G. Such a graph is called self-complementary. Find examples of a self-complementary graph on four vertices and on five vertices.
4. Let G be a simple graph with n vertices. Its complement is the simple graph with the same vertex set and two vertices are adjacent in G if and only if they are not adjacent in G. Such a graph is called self-complementary. Find examples of a self-complementary graph on four vertices and on five vertices.
- 4 Let G Be A Simple Graph With N Vertices Its Complement Is The Simple Graph With The Same Vertex Set And Two Vertices 1 (13.23 KiB) Viewed 37 times