1
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Let $A$ be the adjacency matrix of a simple undirected graph $G$. Suppose $A$ is its own inverse. Which one of the following statements is always TRUE?

A

$G$ is a cycle

B

$G$ is a perfect matching

C

$G$ is a complete graph

D

There is no such graph $G$

2
GATE CSE 2024 Set 1
Numerical
+1
-0

The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is __________

Your input ____
3
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements is/are TRUE for a group G?

A
If for all x, y $$\in$$ G, (xy)2 = x2y2, then G is commutative.
B
If for all X $$\in$$ G, x2 = 1, then G is commutative. Here, 1 is the identity element of G.
C
If the order of G is 2, then G is commutative.
D
If G is commutative, then a subgroup of G need not be commutative.
4
GATE CSE 2022
Numerical
+1
-0

Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is __________.

Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP