In editing a relevance diagram, deleting is the operation that eliminates either a node or an arrow between two nodes. Deleting a node or an arrow should not be confused with the similarly named operation of node removal, which involves applying integration and expectation operations. Deleting a node also deletes any arrows going into it and invalidates the probability distributions associated with its direct successors. Deleting an arrow invalidates the probability distribution of its destination node.

See also: Flipping, Linking and Relevance Diagram.