1. A vertex of degree 1 is called a(n) vertex. A. isolated B. initial C. terminal D. pendent 2. If T is a tree with 999 vertices, then T has edges. A. 999 B. 1000 C. 998 D. 1998 In a pseudograph, loops and multiple edges between the same pair of vertices is allowed. A. True B. False The incidence matrix for Q5 has rows. A. 25 B. 32 C. 5 D. 16 The edges E in a simple graph are a set of ordered pairs of elements of vertices V. A. True B. False In a full m-ary tree, A. every internal vertex has at most m children B. every internal vertex has exactly m childre C. every internal vertex has at least m children D. none of the others In a directed graph, the sum of out-degree is always equal to the number of edges. A. True B. False Using Kruskal's algorithm, at each stage the edges selected will form a tree. A. True B. False Every graph is a tree but not every tree is a graph. A. True B. False If T is a tree with 50 vertices, the largest degree that any vertex can have is 49. 1. True B. False fT is a rooted binary tree of height 5 , then T has at most 25 leaves. True B. False What is the contrapositive of pq ? pq B. qp C. qp D. qp What is the truth value of "If 2+2=4, then elephants can fly"? . True B. False AB=AB, then A=B True B. False