Directed Graphs
- Acyclic Digraph
- Acyclic Orientation
- Apollonian Network
- Arborescence
- Arc Set
- Bayesian Network
- Bermond-Thomassen Conjecture
- BEST Theorem
- Bidirected Edge
- Bidirected Graph
- Butterfly Graph
- Cayley Graph
- Complete Digraph
- Connected Digraph
- Connection Set
- Cyclic Triple
- de Bruijn Graph
- Digraph Inradius
- Digraph Outradius
- Digraph Sink
- Digraph Source
- Digraph Topology
- Directed Cut
- Directed Edge
- Directed Erdős-Sós Theorem
- Directed Graph
- Directed Strongly Regular Graph
- Divorce Digraph
- Eulerian Digraph
- Eulerian Orientation
- Functional Digraph
- Functional Graph
- Gossiping
- Graph Orientation
- Indegree
- Kautz Graph
- Line Digraph
- Max-Flow Min-Cut Theorem
- NANUQ Distance
- Network
- Network Flow
- Newtonian Graph
- North-East Oriented Lattice
- Orbital Digraph
- Oriented Diameter
- Oriented Graph
- Oriented Lattice
- Outdegree
- Phylogenetic Network
- Quasi-Kernel
- Road Coloring Problem
- Robbins' Theorem
- s-t Path Polynomial
- Scale-Free Network
- Score Sequence
- Self-Complementary Digraph
- Self-Converse Digraph
- Semikernel
- Seymour's Second Neighborhood Conjecture
- Shuffle-Exchange Graph
- Simple Directed Graph
- Sink
- Small World Phenomenon
- Smith's Network Theorem
- Source
- State Diagram
- Strongly Connected Component
- Strongly Connected Digraph
- Tournament
- Tournament Matrix
- Transitive Digraph
- Transitive Triple
- Undirected Graph
- Unilateral Digraph
- Voter Model
- Weakly Connected Component
- Weakly Connected Digraph