edited by
618 views
0 votes
0 votes
If G is a simple graph with 15 edges and $\bar G$ has 13 edges, how many vertices does G have?
edited by

1 Answer

Best answer
8 votes
8 votes

We know ,

a) No of vertices in G = No of vertices in G'

b) No of edges in G + No of edges in G'  =  No of edges in Kn (complete graph of n vertices)  =  n(n-1)/2

So considering these 2 properties , we have :

       n(n-1)/2   =   No of edges in G + No of edges in G'

==> n(n-1)/2   =   15 + 13   =  28

==> n  =  8 [Only positive solution to be considered as n is no of vertices]

Hence each of G and G' contain 8 vertices..

selected by

Related questions

1 votes
1 votes
1 answer
1
dd asked Nov 22, 2016
3,187 views
For which values of n are these graphs regular?1. $K_n$2. $C_n$3. $W_n$4. $Q_n$
3 votes
3 votes
1 answer
2
dd asked Nov 22, 2016
3,553 views
How many subgraphs possible with at least one vertex for the following two graphs ? (labelled vertices)1. $K_3$2. $W_4$ (total 4 vertices)
3 votes
3 votes
0 answers
3
dd asked Nov 22, 2016
5,404 views
For which values of n are these graphs bipartite ?1. $K_n$2. $C_n$3. $W_n$4. $Q_n$
1 votes
1 votes
1 answer
4