Every block with at least three vertices are __________connected.

Related MCQs

• What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• A binary tree with 2k vertices of level k has at least _______ vertices.
• Every non-trivial tree has at least _____ vertices of degree one.
• The number of pendant vertices in a full binary tree with n vertices is ________.
• If an edge e is said to join the vertices u and v then the vertices u and v are called __.
• If two edges have same vertices as its terminal vertices those edges are called ____.
• If G is the forest with 54 vertices and 17 connected components, G has                total number of edges.
• The minimum number of edges in a connected cyclic graph on n vertices is
• The minimum number of edges in a connected graph with n vertices is ___________.