N-od

From hyperspacewiki
Jump to: navigation, search

Let $n \geq 3$. A simple $n$-od is a finite graph that is the union of $n$ arcs emanating from a single point $v$, called the vertex.

Simple n-od.png