GATE CSE 2009 | Graph Theory Question 37 | Discrete Mathematics

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

What is the chromatic number of an $$n$$-vertex simple connected graph which does not contain any odd length cycle? Assume $$n \ge 2$$.

$$2$$

$$3$$

$$n-1$$

$$n$$

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

Which one of the following is TRUE for any simple connected undirected graph with more than $$2$$ vertices?

No two vertices have the same degree.

At least two vertices have the same degree.

At least three vertices have the same degree.

AA vertices have the same degree.

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

What is the size of the smallest MIS (Maximal Independent Set) of a chain of nine nodes?

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

What is the chromatic number of the following graph? GATE CSE 2008 Discrete Mathematics - Graph Theory Question 59 English

$$2$$

$$3$$

$$4$$

$$5$$

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 Deadlocks Memory Management File System IO and Protection

Algorithms

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

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 Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory