[Solved] Which of the following statements for a simple graph is correct?

Computer Science Engineering (CSE)
Data Structures (DS)
Non Linear Data Structures - Graphs
Which of the following statements for a ...

Q.	Which of the following statements for a simple graph is correct?
A.	Every path is a trail
B.	Every trail is a path
C.	Every trail is a path as well as every path is a trail
D.	Path and trail have no relation
Answer» A. Every path is a trail

View all MCQs in: Data Structures (DS)

Discussion

Related Questions

If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
Which of the following properties does a simple graph not hold?
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
For the given graph(G), which of the following statements is true?
Which of the following graph traversals closely imitates level order traversal of a binary tree?
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Which of the following ways can be used to represent a graph?
Which of the following is useful in traversing a given graph by Breath first search?
How many of the following statements are correct?
The data structure required for Breadth First Traversal on a graph is?