About this question paper
This is the previous year question paper of Mathematics Graph Theory (MA, MSc) (Semester 3) conducted by Pt. Ravishankar Shukla University, Raipur (Jan 2021). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
MATHEMATICS
Paper Fifth
Time : Three Hours ] [ Maximum Marks : 80
Note : Attempt all Sections as directed.
(Objective/Multiple Choice Questions)
Note : Attempt all questions.
Choose the correct answer :
1. The maximum number of edges in a simple graph with
2. A graph in which are vertices of equal degree is called :
(a) Complete graph
(b) Regular graph
(c) Null graph
3. Every null graph is regular of degree :
4. How many vertices and edges does the graph Cn have ?
5. Isolated vertices are those with :
(a) Zero degree
(b) Degree one
(c) Degree two
6. Pendent vertex of degree :
(a) Zero
(b) One
(c) Two
7. A vertex with zero out degree is called :
(a) Total degree
(b) Source
(c) Sink
8. A graph with chromatic number less than or equal to k is
called :
9. What will be the chromatic number of the following
graph ?
10. How many edges will a tree consisting of N modes have ?
11. How many unique colours will be required for proper vector
colouring of an empty graph having n vertices ?
12. Minimum number of colours required for proper edges
colouring of a graph is called :
(a) Vertex matching
(b) Chromatic index
(c) Colour number
(d) Chromatic number
13. Every graph of odd order is of class :
14. For any graph G :
15. What is the definition of graph according to graph theory ?
(a) Collection of vertices
16. Which one of the following is chromatic number of bipartite
graph ?
17. Which of the following has maximum clique size ?
(a) Perfect graph
(b) Tree
(c) Histogram
(d) Cartesian
18. The number elements in the adjacency matrix of a graph
having 7 vertices is :
19. In the given connected graph G, what is the value of rad (6)
can diam (6) ?
20. Method of intersection is also known as :
(a) Recection
(b) Rediation
(c) Traversing
(d) Graphical triangulation
(Very Short Answer Type Questions)
Note : Attempt all questions.
1. Define topological operations.
2. Define vector space.
3. Explain spectrum properties.
4. Define cyclic graph.
5. Explain uniquely colourable.
6. Define achromatic and the adjoint number.
7. Explain clique parameters.
8. Explain circular arc graph.
(Short Answer Type Questions)
Note : Attempt all questions.
1. Define homomorphism and counteractions with an example.
2. Define adjacency matrix and vector space.
3. For any graph G, prove that :
5. Prove that every graph is an intersection graph.
6. Prove that the complement of every interval graph is a
comparability graph.
7. Prove that any square submatrix of the adjacency matrix F of
range of ) of E. Then the stars span and dimension
(Long Answer Type Questions)
Note : Attempt all questions.
1. Prove that if a graph is homeomorphic from graph G, then G
is contraction of H.
vertices Ln2 and the covering need use only edges
and triangle.
tree graph.
3. Prove that the complement of every interval graph is a
comparability graph.
4. Prove that every comparability graph is perfect.