A connected graph that has no cut vertices is called a ________.

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                        
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• 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 ___________.
• The rank of the incidence matrix of any connected graph G with n vertices is ______.
• A binary tree with 2k vertices of level k has at least _______ vertices.
• 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 ____.
• 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