English

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 H\mathcal{H} is a function of p[0,1]p\in [0,1] that measures, in the limit, the maximum normalized edit distance between a graph of density pp and H\mathcal{H}. In this paper, we address the edit distance function for \mboxForb(H)\mbox{Forb}(H), where H=ChtH=C_h^t, the ttht^{\rm th} power of the cycle of length hh. For h2t(t+1)+1h\geq 2t(t+1)+1 and hh not divisible by t+1t+1, we determine the function for all values of pp. For h2t(t+1)+1h\geq 2t(t+1)+1 and hh divisible by t+1t+1, the function is obtained for all but small values of pp. We also obtain some results for smaller values of hh.

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