GATE CSE 2022 | Graph Theory Question 12 | Discrete Mathematics

GATE CSE 2022

Numerical

-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 2021 Set 1

Numerical

-0

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______

Your input ____

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

The chromatic number of the following graph is _______. GATE CSE 2018 Discrete Mathematics - Graph Theory Question 26 English

Your input ____

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Boolean Algebra K Maps Combinational Circuits Number Systems 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

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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