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].
Graph Difference
See also
Graph Complement, Graph SumExplore with Wolfram|Alpha
References
Skiena, S. "Sum and Difference." §4.1.2 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 131, 1990.Referenced on Wolfram|Alpha
Graph DifferenceCite this as:
Weisstein, Eric W. "Graph Difference." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/GraphDifference.html