MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself.

Detailed explanation-2: -A loop is an edge that connects a vertex to itself. If a graph has more than one edge joining some pair of vertices then these edges are called multiple edges. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.

Detailed explanation-3: -A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both multiple edges and loops.

Detailed explanation-4: -An edge vi, vj having the same vertex as both its end vertices is called a self-loop. Two edges with the same end vertices are referred to as parallel edges. A graph that has neither self-loops nor parallel edges is called a simple graph.

Detailed explanation-5: -An edge connecting a vertex to itself is called a loop. Two edges connecting the same pair of points (and pointing in the same direction if the graph is directed) are called parallel or multiple. A graph with neither loops nor multiple edges is called a simple graph.