Mathematics · Graph Theory
The maximum number of possible non-zero values (entries) in an adjacency matrix of a simple graph with n vertices is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1n
- 2n(n - 1)✓
- 3n(n - 1)2
- 4n(n + 1)2
Correct answer
n(n - 1)
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 Mathematics?
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 Mathematics · Graph Theory