The Gateway to Computer Science Excellence
0 votes
298 views

$S_{1}$ : I teach algorithms and maths.

$S_{2}$ : My professor teaches maths, electronics and computer science.

$S_{3}$ : I have a student of maths.

$S_{4}$ : Algorithm is a part of computer science.

$S_{5}$ : Maths students know computer science.

What would be the chromatic number of a graph, vertices of which are the actors/entities that are involved in the sentences $S_{1}$ to $S_{5}$ and edges to represent the associations/relationships amongst the entities/actors as expressed in the sentences $S_{1}$ to $S_{5}$ above ?

  1. $2$
  2. $3$ 
  3. $4$
  4. None of these
in DS by Boss (30.8k points)
recategorized by | 298 views

2 Answers

0 votes
i got 3
by (113 points)
0
@Ranjan Kr Deka,how you got?Can you please explain. :)
0 votes

it contain a triangle so chromatic no can not be less then 3

by Boss (10.6k points)
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
50,737 questions
57,367 answers
198,496 comments
105,267 users