Table of vertex-symmetric digraphs
= Table of vertex-symmetric digraphs
{wiki=Table_of_vertex-symmetric_digraphs}
The term "vertex-symmetric digraphs" typically refers to directed graphs (digraphs) that exhibit a certain level of symmetry with respect to their vertices. In general, a directed graph consists of vertices and directed edges (arcs) connecting them, and a vertex-symmetric digraph is one that behaves the same way when vertices are permuted.