Graph theory MOC

Graphical neighbours

Let be a general graph. The out-neighbours of a vertex is the set of all vertices reachable from by a single arc graph

and in-neighbours are defined analogously

the cardinality of these being referred to as the out-degree and in-degree respectively.

• If is a graph, the out-neighbours and in-neighbours coïncide and are denoted .
• If is a multidigraph, these are multisets.

---

tidy | en | sembr