COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
multi
|
|
|
single
|
|
|
isolated
|
|
|
none of above
|
Detailed explanation-1: -If a vertex doesn’t have any edges it is called an isolated vertex.
Detailed explanation-2: -vertex: a point or node in a graph. adjacent vertices: two distinct vertices are said be adjacent if there is an edge connecting them. isolated vertex: a vertex of degree zero (no edges going in or out of it) degree of a vertex: the number of edges incident to a given vertex.
Detailed explanation-3: -Any two nodes connected by an edge or any two edges connected by a node are said to be adjacent.
Detailed explanation-4: -An isolated vertex is a vertex with degree zero; that is, a vertex that is not an endpoint of any edge (the example image illustrates one isolated vertex). A leaf vertex (also pendant vertex) is a vertex with degree one.