arXiv Analytics

Sign in

arXiv:1509.07438 [math.CO]AbstractReferencesReviewsResources

On the Edit Distance of Powers of Cycles

Zhanar Berikkyzy, Ryan R. Martin, Chelsea Peck

Published 2015-09-24Version 1

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

Comments: 21 pages, 1 figure
Categories: math.CO
Subjects: 05C35, 05C80
Related articles: Most relevant | Search more
arXiv:1007.1897 [math.CO] (Published 2010-07-12, updated 2012-02-12)
The edit distance function and symmetrization
arXiv:1012.3716 [math.CO] (Published 2010-12-16, updated 2014-09-27)
On the computation of edit distance functions
arXiv:1012.0802 [math.CO] (Published 2010-12-03, updated 2011-02-19)
On the edit distance from $K_{2,t}$-free graphs II: Cases $t\geq 5$