This document discusses how to care for graph automata. It begins by introducing graph automata as a type of cellular automata where cells are connected by edges rather than existing on a grid. Graph automata are able to reproduce with fewer cells than traditional cellular automata by reconstructing edges between dividing cells. The document then covers classifications of graph automata behavior analogous to Wolfram's classifications of cellular automata, exploring the "edge of chaos" for graph automata by varying the number of nodes and graphs. It concludes by discussing potential new aspects of graph automata, such as introducing energy conservation and modeling the growth of living things.