The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
100 views

The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5> will be :

  1. 10 , 31 , 3
  2. 10 , 30 , 3
  3. 10 , 30 , 2
  4. None
in Graph Theory by Loyal (6.8k points)
edited by | 100 views
0
The answer is A help here :(

1 Answer

+2 votes

Sry for the quality..

by Active (1.6k points)

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
50,309 questions
55,743 answers
192,232 comments
90,504 users