Incidence and Adjacency

Let e = ? v1, v2 ? be an edge of a digraph.

Then v1 is adjacent to v2.

And v2 is adjacent from v1.

e is incident to v2.

e is incident from v1.

For an undirected graph we can use the terms “adjacent to” and “incident to” for relationships in both directions.

Previous slide Next slide Back to first slide View graphic version