How to Use
Select graph:
- PI: PI index
- |n-n|: Per edge
- Sym: Symmetry
Symmetry Detection
PI = 0 ⟺ every edge divides the graph equally (vertex-transitive). K_n: PI=0. C_n: PI=0 (even). The closer PI is to 0, the more 'symmetric' the graph. Instant symmetry test!
PI vs Szeged
Szeged: Σ nᵢ·nⱼ (product). PI: Σ |nᵢ-nⱼ| (difference). Szeged captures total partition quality. PI captures partition imbalance. They give complementary information.
Step-by-Step Instructions
- 1Select graph.
- 2For each edge: |nᵢ-nⱼ|.
- 3Sum all terms.
- 4Check if PI=0.
- 5Assess symmetry.