An End Degree for Digraphs

ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree. Our main result is a characterisation of the combined end degree in terms of certain sequences of vertices, which we call end‐exhausting sequences. This establishes a similar, although more complex relationship as known for the combined end degree and end‐defining sequences in undirected graphs.