A graph H is called a(n) ____ of G if V(H) is a subset of V(G) and E(H) is a subset of E(G); that is, every vertex of H is a vertex of G, and every edge in H is an edge in G.
A. matrix
B. intersection
C. subgraph
D. union
Answer: C
Computer Science & Information Technology
You might also like to view...
The Start menu in Windows Vista has the same appearance and works the same as previous versions of Windows
Indicate whether the statement is true or false
Computer Science & Information Technology
An encrypted folder or file uses the Microsoft ____, which sets up a unique, private encryption key associated with the user account that encrypted the folder or file.
A. Encrypting File System B. Advanced Encryption Standard C. Data Encryption Standard D. Block Encryption System
Computer Science & Information Technology
The heap sort algorithm is an improved version of the shell sort.
Answer the following statement true (T) or false (F)
Computer Science & Information Technology
A ____ is a computer program that infects a host computer and then spreads.
scorpion Trojan horse virtual program virus
Computer Science & Information Technology