+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of these adjacency matrices represents a simple graph?

(a) [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

(b) [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

(c) [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

(d) [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

My enquiry is from Adjacency Matrix in portion Graph of Data Structures & Algorithms I

The question was posed to me in an international level competition.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct answer is (d) [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

The explanation is: A simple graph must have no-self loops, should be undirected.

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.

Categories

...