menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
IS&Software Engineering
(381)
Web Technologies
(76)
Numerical Methods
(61)
Artificial Intelligence
(40)
Computer Graphics
(107)
Object Oriented Programming
(105)
Java
(28)
Cloud Computing
(2)
Distributed Computing
(15)
Information Theory
(4)
Data Mining and Warehousing
(24)
Optimization
(19)
Digital Image Processing
(17)
Digital Signal Processing
(31)
Computer Peripherals
(13)
Multimedia
(2)
Geometry
(53)
Integrated Circuits
(8)
Big Data Systems
(1)
Others
(203)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
B.Tech students are eligible only for Integrated...
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
sir ,it's already 17th
It will be live soon.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Graph
0
votes
85
views
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is
(a) 1
(b) k
(c) k-1
(d) k/2
graph-theory
asked
Nov 17, 2018
in
Others
Sriya sarkar
85
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
3
votes
The definition of chromatic number is minimum number of different colors required to color a graph
hence chromatic number is k only
answered
Nov 17, 2018
sandygate
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
1
answer
1
224
views
Doubt on Bipartite Graph
What is T.C. to find maximum number of edges to be added to a tree so that it stays as a bipartite graph? Now my question is, why do we need to add edges to make a tree bipartite? A tree is already bipartite graph. Right?? Again how do we add edges in it?? Is BFS or DFS do any improvement in such a tree?? How to think such a question??
What is T.C. to find maximum number of edges to be added to a tree so that it stays as a bipartite graph? Now my question is, why do we need to add edges to make a tree bipartite? A tree is already bipartite graph. Right?? Again how do we add edges in it?? Is BFS or DFS do any improvement in such a tree?? How to think such a question??
asked
Jun 2, 2019
in
Algorithms
srestha
224
views
graph-theory
algorithms
2
votes
2
answers
2
357
views
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... $x$ and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked
May 23, 2019
in
Graph Theory
srestha
357
views
made-easy-test-series
graph-theory
theory-of-computation
1
vote
2
answers
3
430
views
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
asked
May 19, 2019
in
Graph Theory
Hirak
430
views
graph-theory
discrete-mathematics
1
vote
1
answer
4
245
views
Difference between DAG and Multi-stage graph
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?
asked
Apr 28, 2019
in
Graph Theory
gmrishikumar
245
views
graph-theory
graph-algorithms
graph-connectivity
multi-stage-graph
directed-acyclic-graph
dag
...