Difficulty distribution
How the classified questions are distributed by difficulty.
1questions
Medium
1
100%
Graph Theory - General Aptitude - General Aptitude (GA) Previous Year Questions
Practice Graph Theory - General Aptitude - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
1Papers
1Years
1Questions
1Topics
Graph Theory question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
1questions
MCQ
1
100%
Subject weightage
Top subjects by unique question coverage.
Most asked topics
Top topics across the included previous year papers.
Subtopic coverage
Top subtopics inside this exact selection.
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Included previous year papers
Newest papers appear first. Search these papers or sort by year and name.
| Paper name | Year | Attempt | |
|---|---|---|---|
Computer Science & Information Technology (CS) 2017 [Session 1]2017 | 2017 |
|
|
All Graph Theory previous year questions
Practice every matching question in batches of 20, with every available option.
2017 · General Aptitude (GA) · General Aptitude · Graph Theory
Computer Science & Information Technology (CS) 2017 [Session 1]
Let \(G = (V, E)\) be any connected undirected edge-weighted graph. The weights of the edges in \(E\) are positive and distinct. Consider the following statements:
(I) Minimum Spanning Tree of \(G\) is always unique.
(II) Shortest path between any two vertices of \(G\) is always unique.
Which of the above statements is/are necessarily true?
(I) Minimum Spanning Tree of \(G\) is always unique.
(II) Shortest path between any two vertices of \(G\) is always unique.
Which of the above statements is/are necessarily true?