COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
in-degree
|
|
|
out-degree
|
|
|
inout-degree
|
|
|
none of above
|
Detailed explanation-1: -where the sum is over all nodes in the network. and the in-degree is the number of incoming edges onto a node kini=∑jaij. The total degree of the node is the sum of its in-and out-degree ktoti=kini+kouti.
Detailed explanation-2: -Explanation. The number of incoming edges in graph is known as in-degree nodes and the number of outgoing edges in graph is known as out-degree nodes.
Detailed explanation-3: -The degree of a node in an undirected graph is the number of edges incident on it; for directed graphs the indegree of a node is the number of edges leading into that node and its outdegree, the number of edges leading away from it (see also Figures 6.1 and 6.2).
Detailed explanation-4: -The in-degree of a node is equal to the number of edges with that node as the target.
Detailed explanation-5: -To find the in-degree of a vertex, just count the number of edges ends at the vertex. The Out-Degree of a vertex V written by deg+ (v), is the number of edges with v as the initial vertex. To find the out-degree of a vertex, just count the number of edges starting from the vertex.