I hope to solve all the paragraphs as soon as possible, please Doctor

1. SECTION - A (4x 1 = 4 Marks) Answer ALL questions. Each question carries ONE mark 1. Choose the correct answer: is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph. Path Circuit Directed All of these > The removal of an edge produces a graph with more connected components than in the original graph is called a Cut Vertex Cut Edge Disconnected Connected is the The edge connectivity of a graph G, denoted by minimum number of edges in an edge cut of G. W(G) KG) Q(G) (G) A connected multigraph with at least two vertices has an Lif and only if each of its vertices has even degree. Mixed graph Euler circuit Hamiltonian Path Euler Path