McqMate

Q. |
## A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. |

A. | weakly connected |

B. | strongly connected |

C. | tightly connected |

D. | linearly connected |

Answer» B. strongly connected |

1.6k

0

Do you find this helpful?

3

View all MCQs in

Data Structures (DS)No comments yet

- ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
- A vertex of in-degree zero in a directed graph is called a/an
- A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
- If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
- In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
- With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
- What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A graph is a tree if and only if graph is
- What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.