in Graph Theory edited by
490 views
2 votes
2 votes

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 edited by
by
490 views

1 comment

The answer is A help here :(
0
0

1 Answer

2 votes
2 votes

Sry for the quality..

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