Ask a New Question

Question

A graph G has 200000 edges and for any 3 vertices v,w,x, at least one of the edges vw,wx,xv is not present in G. What is the least number of vertices that G can have?
12 years ago

Answers

John
16
12 years ago
Athul
wrong...blunder..even for a simple graph with all vertices connected is given by n(n=1)/2 for 16 it is 15*8<<200000
12 years ago
Alestair
538
12 years ago
ANswer..
895
12 years ago

Related Questions

What is around edges of the Pacific Ocean? what is 200000 divided by 439? what is 200000 times 56 =? How many edges are in K15, the complete graph with 15 vertices. Any help would be appreciated, th... A simple graph G has 200000 edges and for any 3 vertices v,w,x, at least one of the edges vw,wx,xv i... How many edges are in K15, the complete graph with 15 vertices Mr. Khalid invested 200000 at 12% simple interest and 189744 at 14% simple interest the two amounts... Exponential form for 200000 1000000000000 dovided by 20000000000 Ashira took a loan of $200000 from a bank which offers 15% interest compounded annually for 30 years...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use