Of Notes

Adjacency matrices of the Tutorial 1 graphs

1 min read · revised 19 October 2026 · referred to by 1 note · ·

Table of Contents

Problem

Calculate the adjacency matrices of the three graphs of exercise 1, after relabelling the nodes of the left graph so that its vertex set becomes .

Solution

Convention: iff there is a link , so and .

Relabel the left graph by sending the nodes that point at the hub to , the hub to , and the nodes the hub points at to , so that the link becomes :

old 2 10 6 11 3 9 5 7 4
new 1 6 7 8 9 2 3 4 5

The middle graph is already labelled : for every , and all other entries are .

The right graph is already labelled :

/ 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