GATE CSE 2022 | Graph Theory Question 13 | Discrete Mathematics

PREVIOUS NEXT

GATE CSE 2022

MCQ (Single Correct Answer)

-0.33

Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?

The diagonal entries of A² are the degrees of the vertices of the graph.

If the graph is connected, then none of the entries of A^{n $$-$$ 1} + I_n can be zero.

If the sum of all the elements of A is at most 2(n $$-$$ 1), then the graph must be acyclic.

If there is at least a 1 in each of A's rows and columns, then the graph must be connected.

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

-0.33

Let G be a connected undirected weighted graph. Consider the following two statements.

S₁: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.

S₂: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?

S1 is false and S2 is true.

S1 is true and S2 is false.

Both S1 and S2 are true.

Both S1 and S2 are false.

GATE CSE 2019

MCQ (Single Correct Answer)

-0.33

Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to

(n - 1)!

$${{\left( {n - 1} \right)!} \over 2}$$

GATE CSE 2018

Numerical

-0

Let $$G$$ be a finite group on $$84$$ elements. The size of a largest possible proper subgroup of $$G$$ is ________.

Your input ____

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory