A tree T is called a(n) ____ tree of graph G if T is a subgraph of G such that V(T) = V(G); that is, if all vertices of G are in T.
A. weighted
B. spanning
C. rooted
D. directed
Answer: B
Computer Science & Information Technology
You might also like to view...
Match the following terms to their meanings:
I. Bang operator II. & symbol III. SQL statement IV. Equal sign (=) V. Main form A. must be used to begin an expression B. an instruction using Structured Query Language C. concatenates the string with the rest of the expression D. the exclamation point (!) E. a form that contains a subform
Computer Science & Information Technology
________ means that the QoS tool changes one or more header fields, setting the value in the header
A) Writing B) Marking C) Classifying D) Altering
Computer Science & Information Technology