In _________, its vertex set V can be decomposed into two disjoint subsets V1 and V2 such that every edge in graph joins a vertex in V1 with a vertex in V2.
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- G is a graph on n vertices and 2n-2 edges. The edges of G can be partitioned into two edge-disjoint spannin...
- G is a graph on n vertices and 2n-2 edges. The edges of G can be partitioned into two edge-disjoint spannin...
- In which of the following data structures, for every edge (a, b), there is also an edge (b, a)?
- In which of the following data structures, there is exactly one edge directed from every other vertex?
- The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n $\ge$ 6 . Two vertices of...
- 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...
- Which of the following data structures is an undirected graph that may contain multiple edges or loops?