Scribd
Upload
49 views2 pages

Assignment No (1) : Yousra Osman Khlil Ibrahim March 9, 2020

The document discusses computing the number of edges (m) in a graph based on the degrees of its nodes. It states that using the handshaking lemma, the number of edges can be calculated as the sum of the degrees of all nodes divided by 2. It then asks to apply this formula to calculate m for 3 given networks based on their node degrees shown in pictures.

Uploaded by

Yousra Osman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views2 pages

Assignment No (1) : Yousra Osman Khlil Ibrahim March 9, 2020

The document discusses computing the number of edges (m) in a graph based on the degrees of its nodes. It states that using the handshaking lemma, the number of edges can be calculated as the sum of the degrees of all nodes divided by 2. It then asks to apply this formula to calculate m for 3 given networks based on their node degrees shown in pictures.

Uploaded by

Yousra Osman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment No(1)

Yousra Osman Khlil Ibrahim

March 9, 2020
1- Given a simple graph G=(V,E) with ”n” nodes and”m” edges with an
apprepriate justification deduce a formula for computing ”m” as a function of
the degrees of the nodes.

sol:
By using the handshaking lemma we can deduce a rule for computing ”m” :
n
X
ki = 2m
i=1

Where: ki ≡ the degree of nodes. m ≡ number of edges.

2- Using your formula from (1),calculate the number of edges in each of the
following three networks:

[width=height=]Desktop/pic(1)

You might also like