402 views

1 Answer

0 votes
0 votes

sample graph of above question will be

four corners will be having total degree = 4*3=12

four sides {except corner} will be having total degree = 40*5=200

now, nodes which are in between {100 nodes are there}  are having total degree =100*8=800

total degree = 12+200+800= 1012

as we know, sum of degree =2e

2e=1012

e=506

Related questions

0 votes
0 votes
1 answer
1
shuham kumar asked Nov 18, 2022
417 views
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
2 votes
2 votes
1 answer
2
jugnu1337 asked Dec 17, 2021
537 views
complete directed graph with 8 vertices has 28 edges this statement is true or falseplese explain?
5 votes
5 votes
2 answers
3
Nidhi Budhraja asked Aug 26, 2018
2,410 views
Stmt 1: A simple graph is necessarily connected if |E| (n-1)*(n-2)/2.Stmt2: A simple graph with n vertices and k components has at least n-k edges.Can you please explain...
2 votes
2 votes
1 answer
4
VS asked Jan 16, 2018
1,253 views
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)