Which of the following statements for a simple graph is correct?Options Path and trail have no relation Every trail is a pathEvery path is a trailEvery trail is a path as well as every path is a trail

4. Which of the following is true?(a) A graph may contain no edge and many vertices(b) A graph may contain no edges and no vertices(c) A graph may contain no edges and no vertices(d) A graph may contain no vertices and many edges

Which of the following statements is true about Eulerian paths ?Select one:a. Every connected graph has an Eulerian path.b. An Eulerian path exists if and only if every vertex in the graph has an odd degree.c. An Eulerian path can exist even if the graph is not connected.d. An Eulerian path exists in a connected graph if and only if exactly zero or two vertices have odd degrees.

Which of the following is true?Group of answer choicesA graph may contain many edges and no verticesA graph may contain no edges and many verticesA graph may contain no edges and no verticesA graph may contain no vertices and many edges

Which of the following properties does a simple graph not hold?Group of answer choicesMust be connectedMust be unweightedMust have no loops or multiple edgesMust have no multiple edges

For a given graph G having v vertices and e edges which is connected and has nocycles, which of the following statements is true?(a) v = e(b) v = e + 1(c) v + 1 = e(d) v = e – 1