+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 edges

My doubt is from Incidence Matrix and Graph Structured Stack topic in chapter Graph of Data Structures & Algorithms I

This question was posed to me in examination.

1 Answer

+1 vote
by (737k points)
selected by
Best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.