Arc-Transitive Graph Checker

directed arc symmetry

CheckersFreeNo Signup
4.3(172 reviews)
All Tools

Loading tool...

About Arc-Transitive Graph Checker

An arc-transitive (symmetric) graph checker testing if for every pair of arcs (u₁,v₁),(u₂,v₂) there exists an automorphism mapping u₁→u₂ and v₁→v₂. Strongest common symmetry. Arc-transitive → vertex-transitive AND edge-transitive. Client-side.

Arc-Transitive Graph Checker Features

  • Arc-trans test
  • VT+ET implied
  • s-arc trans
  • Foster census
  • Common graphs
Arc-transitive (symmetric): automorphism group acts transitively on ordered pairs (arcs). Strongest standard symmetry: arc-transitive → vertex-transitive AND edge-transitive. K_n, Petersen, hypercube are arc-transitive. s-arc-transitive: transitivity on walks of length s.

How to Use

Select graph:

  • Test: Arc-transitive?
  • s-arc: Walk length
  • Implies: VT + ET

s-Arc Transitivity

s-arc-transitive: transitive on walks (v₀,v₁,...,vₛ) of length s with vᵢ≠vᵢ₊₂. Tutte (1947): cubic arc-transitive graphs are at most 5-arc-transitive! Weiss (1981): for valency ≥3, at most 7-arc-transitive. Deep results.

Foster Census

Foster census: complete list of cubic arc-transitive graphs. Started by Ronald Foster (1932). Contains all cubic symmetric graphs up to large orders. Fundamental reference for algebraic graph theory.

Step-by-Step Instructions

  1. 1Select graph.
  2. 2Check arcs.
  3. 3Determine s-value.
  4. 4Compare VT/ET.
  5. 5Classify symmetry.

Arc-Transitive Graph Checker — Frequently Asked Questions

VT+ET = arc-transitive?+

Not always! VT+ET is sometimes called 1/2-transitive. Arc-transitive (symmetric) is strictly stronger. But for many common graphs, VT+ET does imply arc-transitive. Counterexamples: Holt graph (27 vertices).

What's the Petersen graph's symmetry?+

Petersen is 3-arc-transitive! |Aut| = 120. It's both vertex- and edge-transitive. In fact, it's one of the most symmetric cubic graphs. Also 3-regular, distance-transitive.

What's Tutte's theorem for cubic?+

Every cubic (3-regular) arc-transitive graph is at most 5-arc-transitive. The maximum is achieved by Tutte-Coxeter graph (Levi graph of PG(2,3)). Beautiful bound using group theory.

Share this tool: