GATE CS 2023 Set 1 — Question 30

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+1 / -0MediumEigenvalues & EigenvectorsLinear AlgebraEngineering MathematicsAdjacency Matrix & ListGraphs (Data Structure)Programming & Data Structures

Engineering Mathematics → Graphs (Data Structure) → Adjacency Matrix & List

Last updated

Question

Let AA be the adjacency matrix of the graph with vertices {1, 2, 3, 4, 5}.
Directed graph with 5 vertices. Vertex 3 and 4 have self-loops. Edges exist from 5 to 3, 5 to 4, 3 to 2, 4 to 2, and 2 to 1.
Let λ1,λ2,λ3,λ4\lambda_1, \lambda_2, \lambda_3, \lambda_4, and λ5\lambda_5 be the five eigenvalues of AA. Note that these eigenvalues need not be distinct.
The value of λ1+λ2+λ3+λ4+λ5=________\lambda_1 + \lambda_2 + \lambda_3 + \lambda_4 + \lambda_5 = \_\_\_\_\_\_\_\_.
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Graphs (Data Structure)