One really clear cut one is that a graph database might need to compute the transitive closure which is impossible with plain SQL/relational algebra (technically possible with recursive SQL). One example of this might be you have some relation of parents to children and you want to select the ancestors of some child where an ancestor is either a parent or an ancestor of a parent.