1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following graphs is NOT planar? GATE CSE 2005 Discrete Mathematics - Graph Theory Question 28 English
A
G1
B
G2
C
G3
D
G4
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
What is the number of vertices in an undirected connected graph with $$27$$ edges, $$6$$ vertices of degree $$2$$, $$\,\,$$ $$3$$ vertices of degree 4 and remaining of degree 3?
A
$$10$$
B
$$11$$
C
$$18$$
D
$$19$$
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
How many graphs on $$n$$ labeled vertices exist which have at least $$\left( {{n^2} - 3n} \right)/2\,\,\,$$ edges?
A
$${}^{\left( {{n^ \wedge }2 - n} \right)/2}{C_{\left( {{n^ \wedge }2 - 3n} \right)/2}}$$
B
$${\sum\limits_{k = 0}^{\left( {{n^ \wedge }2 - 3n} \right)/2} {{}^{\left( {{n^ \wedge }2 - n} \right)}{C_k}} }$$
C
$${}^{\left( {{n^ \wedge }2 - n} \right)/2}{C_n}$$
D
$$\sum\nolimits_{k = 0}^n {{}^{\left( {{n^ \wedge }2 - n} \right)/2}{C_k}} $$
4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is GATE CSE 2004 Discrete Mathematics - Graph Theory Question 66 English
A
2
B
3
C
4
D
5
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12