1.

The column sum in an incidence matrix for a directed graph having no self loop is __________(a) 0(b) 1(c) 2(d) equal to the number of edgesMy doubt is from Incidence Matrix and Graph Structured Stack topic in chapter Graph of Data Structures & Algorithms IThis question was posed to me in examination.

Answer»

Correct choice is (a) 0

Easy explanation - Under EVERY EDGE COLUMN there would be either all 0 values or a pair of -1 and +1 VALUE exists.



Discussion

No Comment Found

Related InterviewSolutions