1
GATE CSE 2020
Numerical
+2
-0
Graph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colours required to edge-colour G is _____.
Your input ____
2
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67

Let G be any connected, weighted, undirected graph.

I. G has a unique minimum spanning tree, if no two edges of G have the same weight.

II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.

Which of the above two statements is/are TRUE?

A

I only

B

II only

C

Both I and II

D

Neither I nor II

3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is
A
A multiple of $$4$$
B
Even
C
Odd
D
Congruent to $$0$$ $$mod$$ $$4$$, or, $$1$$ $$mod$$ $$4.$$
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
A
A tree has no bridges
B
A bridge cannot be part of a simple cycle
C
Every edge of a clique with size $$ \ge 3$$ is a bridge (A clique is any complete sub-graph of a graph )
D
A graph with bridges cannot have a cycle
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP