Graph Exploration

3V, 2E

Visualize graphs as mechanical linkages. Each vertex with degree k requires dimension ≥ k and has DOF = d - k in dimension d. Flexible vertices can move while preserving edge lengths.

3D Linkage View

Interactive visualization with constraint spheres

Fold to:
Select a target dimension above to animate the folding process

Graph Analysis

Minimal Dimension

Requires at least 1D (line)

Rigidity
Largest Clique
ω(G) = 2

Contains K₂ (edge)

{v₁, v₂}{v₂, v₃}
Laman (2D)
No

|E| = 2, need 3 for Laman

Path graph with 3 vertices. Can always fold to a line (1D).

Vertex Analysis

Dual perspectives: construction (↑) and folding (↓)

d_min
2
Current
3
Total DOF
5
Can fold: 3D → 2D

VertexDegreeDOF
v₂
v₁
v₃

Construction view: Each vertex with degree k requires at least dimension k for generic positioning.

Folding view: In dimension d, each vertex with degree k has DOF = d - k. Vertices with DOF > 0 can move.

Folding Metrics

Current--
3D
2D
1D
Waiting for coordinate data...

2D Graph Layout

Abstract graph representation with node coordinates

Graph Matrices

Different matrix representations capturing the graph's combinatorial structure

Adjacency Matrix

v₁v₂v₃
v₁010
v₂101
v₃010

The adjacency matrix A has A[i,j] = 1 if vertices i and j are connected by an edge.