Line Digraph
LineGraphDirected
The line digraph of a directed graph G is the directed graph L(G) whose vertex set corresponds to the arc set of G and having an arc directed from an arc e_1 to an arc e_2 if, in G, the head of e_1 meets the tail of e_2 (Harary and Palmer 1973, p. 264; Gross and Yellen 2006, p. 265).
See also
BEST Theorem, Directed Graph, Graph Arc, Line GraphExplore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Gross, J. T. and Yellen, J. Graph Theory and Its Applications, 2nd ed. Boca Raton, FL: CRC Press, p. 265, 2006.Harary, F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems." In A Survey of Combinatorial Theory (Ed. J. N. Srivastava). Amsterdam, Netherlands: North-Holland, pp. 259-275, 1973.Cite this as:
Weisstein, Eric W. "Line Digraph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/LineDigraph.html