COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
parallel
|
|
|
level
|
|
|
both a and b
|
|
|
none of above
|
Detailed explanation-1: -In graph theory, multiple edges (also called parallel edges or a multi-edge), are, in an undirected graph, two or more edges that are incident to the same two vertices, or in a directed graph, two or more edges with both the same tail vertex and the same head vertex.
Detailed explanation-2: -Parallel Edges. If two distinct edges have the same pair of endpoints, then the edges are said to be parallel. 1.2.
Detailed explanation-3: -Def. 2-1. A graph G consists of a finite non-empty set V(G) of vertices together with a set E(G) of unordered pairs of distinct vertices, called edges. If x = u, v ∈ E(G), for u, v ∈ V(G), we say that u and v are adjacent vertices, and that vertex u and edge x are incident with each other, as are v and x.
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: -In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges), that is, edges that have the same end nodes.