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
Option : a Explanation: In a walk if the vertices are distinct it is called a path, whereas if the edges are distinct it is called a trail.
Which of the following is true? a) A graph may contain no edges and many vertices b) A graph may contain many edges and novertices c) A graph may contain no edges and no vertices d) A graph may contain no vertices and many edges
Option : b Explanation: A graph must contain at least one vertex.