GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
123 views

Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have is

a) (n-1)(n-2)/2
b) n(n-1)/2
c) n-1
d) n

asked in Mathematical Logic by Junior (959 points)   | 123 views

I am getting option a , but by substitution , what is the standard way to solve it. I solve it for n=3,4 ,5 and got option a

think like ...

you have a grapg A with n vertices.  excepts one vertex, all n-1 vertices are making a complete graph with total

(n-1)(n-2)/2 edges. Now if we see complement of this graph then it would be connected right ( A' ->star graph)??

And if we add any more edge in A,  then it would make its complement disconnected ...

Note-  we are not told that A is also connected.. only A' is connected.

just give it  think ..

1 Answer

+2 votes
Best answer
If  $A^c$   is connected then minimum no. of  edges in $A^c$   are n-1

so  maximum no. of edges in A= Total edges - minimum edges in $A^c$

= $_{2}^{n}\textrm{c}$ - (n-1)

=n(n-1)/2 -(n-1)

=(n-1)(n-2)/2

option A)
answered by Loyal (3.9k points)  
selected by
option A is correct.


Top Users Jul 2017
  1. Bikram

    4894 Points

  2. manu00x

    2888 Points

  3. Debashish Deka

    1870 Points

  4. joshi_nitish

    1776 Points

  5. Arjun

    1496 Points

  6. Hemant Parihar

    1306 Points

  7. Shubhanshu

    1128 Points

  8. Arnab Bhadra

    1114 Points

  9. pawan kumarln

    1114 Points

  10. Ahwan

    940 Points


24,089 questions
31,062 answers
70,677 comments
29,400 users