A minimal non-empty edge cut of G is called a _________.

Related MCQs

• If an expression is given that x+x’y’z=x+y’z, find the minimal expression of the function F(x,y,z) = x+x’y’z+yz?
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                
• If an edge e is said to join the vertices u and v then the vertices u and v are called __.
• Two vertices which are incident with the common edge are called ______________vertices.
• An edge with identical ends is called _________.
• An edge with same ends is called ___________.
• Each edge has one end in set X and one end in set Y then the graph (X, Y) is called _____graph.
• A connected graph that has no cut vertices is called a ________.
• In a              the vertex set and the edge set are finite sets.
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?