Computer Science · Graph Theory
Match LIST-I with LIST-II: LIST-I (Graph Model) A. Null Graph (n ≥ 2) B. Path Graph (Pn, n ≥ 2) C. Cycle Graph (Cn, n ≥ 3) D. Complete Graph (Kn) LIST-II (Connectivity & Degree Constraints) I. Mandates exactly two vertices of degree 1 and possesses a vertex connectivity of exactly 1. II. Characterised strictly as a 0-regular graph where every vertex operates as an isolated component. III. Defined as an (n-1)-regular structure guaranteeing (n-1)-vertex-connectivity. IV. Functions as a strictly 2-regular graph that maintains a 2-vertex-connectivity.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-II, B-IV, C-I, D-III
- 2A-II, B-I, C-IV, D-III✓
- 3A-III, B-I, C-II, D-IV
- 4A-I, B-II, C-IV, D-III
Correct answer
A-II, B-I, C-IV, D-III
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