X-Nico

unusual facts about Directed graph


Dynkin diagram

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.


Andhra University College of Engineering

S. Rao Kosaraju, Computer Science (1959-1964), Founder of the Kosaraju's algorithm, which finds the strongly connected components of a directed graph

Combinatorial proof

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.


see also

Kosaraju

Kosaraju's algorithm, an algorithm to find the strongly connected component of a directed graph.