An alternative way to define graphs as binary algebras on a set of vertices is considered. For the resulting algebras, we describe congruences, ideals and subalgebras, and obtain criterion for such a graph algebra to be a semigroup. In addition, we consider a practical application of graph algebras for data compression.