The graph difference of graphs 
and 
is the graph with adjacency
matrix given by the difference of adjacency matrices of 
and 
. A graph difference is defined when the orders of 
and 
are the same, and can be computed in the Wolfram
Language using GraphDifference[g,
h].
