Edge rotations and distance between graphs
From MaRDI portal
Publication:3682519
DOI10.21136/cpm.1985.118225zbMath0567.05044OpenAlexW2731124254MaRDI QIDQ3682519
Hung Bin Zou, Farrokh Saba, Gary Chartrand
Publication date: 1985
Full work available at URL: https://eudml.org/doc/21591
Related Items (18)
Approximating degree sequences with regular graphic sequences (extended abstract) ⋮ Distances between graphs under edge operations ⋮ Subgraph distances in graphs defined by edge transfers ⋮ Unnamed Item ⋮ Greatest common subgroups with specified properties ⋮ Edge rotation and edge slide distance graphs ⋮ Two metrics in a graph theory modeling of organic chemistry ⋮ Measuring closeness of graphs -- the Hausdorff distance ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ Planar graphs and greatest common subgraphs ⋮ Degree-anonymization using edge rotations ⋮ Model-free two-sample test for network-valued data ⋮ Transition operations over plane trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graphic sequences, distances and \(k\)-degree anonymity ⋮ On the rotation distance of graphs ⋮ Determining the Hausdorff Distance Between Trees in Polynomial Time
This page was built for publication: Edge rotations and distance between graphs
