4 views

1 Answers

In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps e1 to e2.

In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.

4 views

Related Questions

What is McKay graph?
1 Answers 5 Views
What is Crown graph?
1 Answers 4 Views
What is Archimedean graph?
1 Answers 5 Views
What is Heawood graph?
1 Answers 6 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Half-transitive graph?
1 Answers 4 Views
What is Silhouette edge?
1 Answers 8 Views
What is Edge Falls?
1 Answers 4 Views