Given an adjacency matrix A = [ [0 1 1] [1 0 1] [1 1 0] ] The total no. of ways in which every vertex can walk to itself using 2 edges is ________

MCQOPTIONS

Explore topic-wise MCQs in Data Structure.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.	Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________
A.	2
B.	4
C.	6
D.	8
Answer» D. 8

Discussion

Explore topic-wise MCQs in Data Structure.

Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________