In the mathematical field of graph theory, the Balaban 11-cage or Balaban (3,11)-cage is a 3-regular graph with 112 vertices and 168 edges named after Alexandru T.

[2] The uniqueness was proved by Brendan McKay and Wendy Myrvold in 2003.

[3] The Balaban 11-cage is a Hamiltonian graph and can be constructed by excision from the Tutte 12-cage by removing a small subtree and suppressing the resulting vertices of degree two.

[4] It has independence number 52,[5] chromatic number 3, chromatic index 3, radius 6, diameter 8 and girth 11.

The characteristic polynomial of the Balaban 11-cage is: The automorphism group of the Balaban 11-cage is of order 64.