Premise: At the left side of the graph where volume is least costly to deliver we find the most multiple address stops.

Hypothesis: The graph has a right side in addition to its left side.
Relation: entailment