Abstract
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge operations: the edge move, rotation and slide distances. We derive relations between the metrics, and bounds on the distance between arbitrary graphs and between arbitrary trees. We also consider the sensitivity of the metrics to various graph operations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have