GATE CSE 2015 Set 1 | Graph Theory Question 25 | Discrete Mathematics

GATE CSE 2015 Set 1

Numerical

-0

Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in 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

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.6

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is

A multiple of $$4$$

Even

Odd

Congruent to $$0$$ $$mod$$ $$4$$, or, $$1$$ $$mod$$ $$4.$$

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.6

If $$G$$ is a forest with $$n$$ vertices and $$k$$ connected components, how many edges does $$G$$ have?

$$\left\lfloor {n/k} \right\rfloor $$

$$\left\lceil {n/k} \right\rceil \,$$

$$n - k$$

$$n - k + 1$$

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

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

Numerical Ability Logical Reasoning Verbal 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