Multiple Choice
A graph is ______ if each pair of distinct vertices has a path between them.
A) complete
B) disconnected
C) connected
D) full
Correct Answer:
Verified
Related Questions
Q1: A _ is the subset of vertices
Q3: A _ order is a list of
Q4: A graph consists of _ sets.
A)two
B)three
C)four
D)five
Q5: Two vertices that are joined by an
Q6: A self edge is also called a
Q7: A graph is _ if it has
Q8: In a graph,a vertex is also known
Q9: If there is a directed edge from
Q10: A _ can have duplicate edges between
Q11: A path is a sequence of _
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents