in Graph Theory recategorized by
1,227 views
0 votes
0 votes

$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 Graph Theory recategorized by
1.2k views

2 Comments

moved by
i got 3
0
0
@Ranjan Kr Deka,how you got?Can you please explain. :)
0
0

2 Answers

0 votes
0 votes

s1 ------------------------------------s4

|                                         |

|                                         |

|                                         |

s3------------------------------------s2

s1 , s2, s3, s4 are 4 vertices. 

 s1 and s2 can have same color (say blue)

s3 and s4 can have same color (say red)

so chromatic no is 2 option A

is my answer correct ?

1 comment

What are the entities you have considered here? Your answer is not clear.
0
0
0 votes
0 votes

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

Related questions

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