Every non-trivial tree has at least _____ vertices of degree one.

Related MCQs

• Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
• 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?
• A binary tree with 2k vertices of level k has at least _______ vertices.
• The number of pendant vertices in a full binary tree with n vertices is ________.
• 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              
• Every block with at least three vertices are __________connected.
• 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                        
• 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 ____.
• The number of vertices in a full binary tree is _______.