  We present the Boolean dimension of a graph, we relate it with the notions of
inner, geometric and symplectic dimensions, and with the rank and minrank of a
graph. We obtain an exact formula for the Boolean dimension of a tree in terms
of a certain star decomposition. We relate the Boolean dimension with the
inversion index of a tournament.
