An **edge-transitive graph** is a type of graph that has a high degree of symmetry. Specifically, a graph is called edge-transitive if, for any two edges in the graph, there exists an automorphism (a graph isomorphism from the graph to itself) that maps one edge to the other. This means that all edges of the graph are essentially indistinguishable in terms of the structure of the graph.
Articles by others on the same topic
There are currently no matching articles.