The question is in the title, but let me specify what I mean by the category of graphs.

In the context of this question, the category of graphs is the category of symmetric *irreflexive* relations. That means, not the category of symmetric *reflexive* relations.
That means, no loops and at most one edge between vertices.