In the mathematical field of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line) and, within certain constraints, directed multiple edges.
directed | Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Directed-energy weapon | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | ''What's Wrong With Angry?'' Poster for the 2008 Edinburgh Fringe production directed by Patrick Wilde | visibility graph | Unit distance graph | Shia LaBeouf in the video for "Fjögur Píanó" directed by Alma Har'el | Scene from '''Stanley Keyes''' play ''Dragon Slayers,'' directed by Brad Mays | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph |
S. Rao Kosaraju, Computer Science (1959-1964), Founder of the Kosaraju's algorithm, which finds the strongly connected components of a directed graph
An alternative bijective proof, given by Aigner and Ziegler and credited by them to André Joyal, involves a bijection between, on the one hand, n-node trees with two designated nodes (that may be the same as each other), and on the other hand, n-node directed pseudoforests.
Kosaraju's algorithm, an algorithm to find the strongly connected component of a directed graph.