Complete graph……/

A graph Gis said to be complete if every vertex in Gis connected to every other vertex in G. Thus a complete graph

 

A simple example for Complete graph

completed graph 1

 

complete grapg 2

this is about simple theory of complete graph

Next problem is find no.of way’s to completed  n  no.of vertex’s

if n=3

Ans is 3

if n=4

ans is 6

check the above fig”s

IF n=200 or 400 or 1000 or above

how to find

?

?

?

??

???

????

?????

The solution  is  simple i got an formula for that

IS

(n(n-1))/2

Example is

if n=4

(4(4-1))/2

ANS is 6

Problem is done

Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s