If every node u in G is adjacent to every other node v in G, A graph is said to be
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of com...
- Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of com...
- A graph has adjacency matrix of all 1’s then
- In a graph if e=[u, v], Then u and v are called
- A graph G has an Euler cycle, then G is connected and every vertex has:
- A graph G has an Euler cycle, then G is connected and every vertex has:
- A graph G with 'n' nodes is bipartite if it contains
- A connected graph T without any cycles is called