GATE CSE 2009 | Graph Theory Question 38 | Discrete Mathematics

PREVIOUS NEXT

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$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has

9 edges and 5 vertices

9 edges and 6 vertices

10 edges and 5 vertices

10 edges and 6 vertices

PREVIOUS NEXT

GATE CSE Subjects

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

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

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

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

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability