Ask HN: Is this a good design to store history of a graph in graph databases?

Say, I have following relation:

    (node A.uuid) -- [relation AB.uuid] --> (node B.uuid)

And I store history of a node, say `node A`, as follows:

    (node A.uuid) -- [has:{datetime,session}] --> (node A.history)
    (node A.history) -- [contains:{datetime, session, relation AB.x.uuid, to:node B.y.uuid}] --> (node A.n.uuid)
    :
    :
    (node A.history) -- [contains:{datetime, session, relation AB.p.uuid, to:node B.q.uuid}] --> (node A.0.uuid)

Is this a good approach to store history of a node in a graph database? What are the better ways to do this?

Also, how do I store the history of the relation/edge `relation AB`? Is it same as the node?