Of Notes

Simple and directed graphs and their vertex and edge sets

1 min read · revised 19 October 2026 · referred to by 5 notes · ·

Table of Contents

Problem

Which of the three graphs below is simple? Which of them is directed? Give for each of them the vertex set and the edge set .

The three graphs of Tutorial 1: \(G_{\text{left}}\) is directed, \(G_{\text{middle}}\) and \(G_{\text{right}}\) are not.
Fig. 1. The three graphs of Tutorial 1: is directed, and are not.

Solution

None of the graphs has a self-interaction, so all three are simple. Only has arrows, so it is the only directed one.

An edge is the link , in line with iff . Undirected links are written once as and count as both and .

  • : , with links , , , , , , , , .
  • : , with the eight links for .
  • : , with links , , , , .
/ 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