On the Edit Distance of Powers of Cycles
Combinatorics
2015-09-25 v1
Abstract
The edit distance between two graphs on the same labeled vertex set is defined to be the size of the symmetric difference of the edge sets. The edit distance function of a hereditary property is a function of that measures, in the limit, the maximum normalized edit distance between a graph of density and . In this paper, we address the edit distance function for , where , the power of the cycle of length . For and not divisible by , we determine the function for all values of . For and divisible by , the function is obtained for all but small values of . We also obtain some results for smaller values of .
Keywords
Cite
@article{arxiv.1509.07438,
title = {On the Edit Distance of Powers of Cycles},
author = {Zhanar Berikkyzy and Ryan R. Martin and Chelsea Peck},
journal= {arXiv preprint arXiv:1509.07438},
year = {2015}
}
Comments
21 pages, 1 figure