GATE CSE 2021 Set 1 | Graph Theory Question 9 | Discrete Mathematics

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0.67

Let G be a group order 6, and H be a subgroup of G such that 1 < |H| < 6. Which one of the following options is correct?

G is always cyclic, but H may not be cyclic.

G may not be cyclic, but H is always cyclic.

Both G and H are always cyclic.

Both G and H may not be cyclic.

GATE CSE 2021 Set 1

Numerical

-0.67

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 2020

Numerical

-0.67

Graph G is obtained by adding vertex s to K_3,4 and making s adjacent to every vertex of K_3,4. The minimum number of colours required to edge-colour G is _____.

Your input ____

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.6

In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

A tree has no bridges

A bridge cannot be part of a simple cycle

Every edge of a clique with size $$ \ge 3$$ is a bridge (A clique is any complete sub-graph of a graph )

A graph with bridges cannot have a cycle

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

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 Dynamic Programming P and NP Concepts

Digital Logic

K Maps Boolean Algebra 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

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

Verbal Ability Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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