Symmetric graph
The term symmetric graph is used in graph theory with two different meanings:
- A symmetric graph is an arc - transitive graph, ie a graph whose automorphism group is transitive on the set of ordered pairs operates one of the adjacent corners.
- In theory, the directed graph is called a directed graph symmetric graph, in each case either no ( directed) in which edge extends between two of its nodes or edges run in both directions. A symmetric directed graph corresponds therefore clearly an undirected graph.
- Disambiguation