Graph Power Calculator

d(u,v) ≤ k → adjacent

All Tools

Loading tool...

About Graph Power Calculator

A graph power calculator computing G^k: same vertex set, uv edge iff d_G(u,v)≤k. G^1=G, G^2=square graph, G^∞=K_n (connected G). Fleischner's theorem: G^2 is Hamiltonian if G is 2-connected. Client-side.

Graph Power Calculator Features

  • G^k edges
  • Square G²
  • Cube G³
  • Edge growth
  • Diameter reduction
Advertisement
Advertisement