About as minimal a graphical representation as you can get would be to have a tree of application nodes with S and K combinators as leaf nodes.

You can compile any lambda calculus expression down to S and K and "run" them as a graph.

Doing this on real calculation probably wins a prize for non clarity though...