1,795 views

1 Answer

Best answer
1 votes
1 votes

As there are 7 entries in degree sequence so ,

No of vertices = 7

Now applying Handshaking Theorem , we have

        Sum of degrees    =    2 * No of edges

==>  2 e   =  3 * 6  + 6

==>  e      =  24 / 2   =  12

Now assuming the planarity and assuming only one connected component and hence applying Euler's formula we have :

No of faces   =   e - n + 2

                    =   12 - 7 + 2

                    =    7  

In general ,

No of faces of a planar graph with k connected components = e - n + k + 1

So minimum possible number of faces for a planar graph will be 7 as found by having no of connected components  =  1

So number of possible number of faces will be 6 with the given number of edges and vertices only if it is non planar..

With this assumption,

2) should be the correct answer..

selected by

Related questions

2 votes
2 votes
0 answers
1
0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
475 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
0 votes
0 votes
3 answers
3
Purple asked Jan 30, 2016
780 views
The number of colors needed to edge color a simple graph with maximum degree Δ is?Is this there in portion?