Mathematics · Graph Theory
Consider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A3
- 2A3 divided by 2
- 3A3 divided by 3
- 4A3 divided by 6✓
Correct answer
A3 divided by 6
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