Of Notes

In- and out-degrees of the Tutorial 1 graphs

1 min read · revised 19 October 2026 · ·

Table of Contents

Problem

Calculate all in-degrees and all out-degrees of the three graphs of exercise 1.

Solution

Convention: iff there is a link , so and .

The left graph is directed, so its in- and out-degrees differ (original labels):

2 3 4 5 6 7 9 10 11
0 4 1 1 0 2 1 0 0
1 4 1 0 1 0 0 1 1

The other two graphs are not directed, so , the sum of row of .

  • Middle: , and for the other eight nodes.
  • Right: , , .
/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card