recategorized by
1,237 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
recategorized by

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 ?

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
2
makhdoom ghaya asked Sep 16, 2016
1,834 views
At any given time Parallel Virtual Machine (PVM) has _______ send buffer and ________ receive buffer.One-oneOne-twoTwo-twoTwo-one
0 votes
0 votes
0 answers
3
0 votes
0 votes
1 answer
4
makhdoom ghaya asked Sep 16, 2016
1,329 views
A leased special high-speed connection from the local telephone carrier for business users that transmits at $1.544$ mbps is known as ________ carrier.$T_{1}$$T_{2}$$T_{3...