Computer Sciences > GATE 2014 SET-1 > Graph Theory
An ordered n-tuple (d1, d2,..., dn) with d1 ≥ d2 ≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2,..., dn respectively. Which of the following 6-tuples is NOT graphic?
Correct : c
Similar Questions
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected co...
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
Total Unique Visitors
Loading......