Computer Science · Graph Theory
Consider the following statements regarding the structural rules of Adjacency Matrices in graph representations: I. For a graph with n vertices, the adjacency matrix is an n × n matrix where the entry A[i][j] = 1 if there is an edge from vertex i to vertex j, and 0 otherwise. II. The adjacency matrix of an undirected simple graph is symmetric and its diagonal entries are equal to 0. III. The adjacency matrix of a directed graph must always be symmetric. IV. In a directed graph representation, an entry A[i][j] = 1 strictly signifies the presence of an edge from vertex i to vertex j. Choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1I, III and IV Only
- 2I, II and IV Only✓
- 3II, III and IV Only
- 4I, II and III Only
Correct answer
I, II and IV Only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory