- 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 35 times
4. Let G be a simple graph with n vertices. Its complement is the simple graph with the same vertex set and two vertices
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
4. Let G be a simple graph with n vertices. Its complement is the simple graph with the same vertex set and two 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 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.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!