arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.07170math.CO
收藏

几类图的编辑距离函数

The edit distance function of some graphs

Yumei Hu, Yongtang Shi, Yarong Wei

摘要:

遗传特性$\mathscr{H}$的编辑距离函数是密度图$p\in[0,1]$和$\mathscr{H}$之间的渐近最大编辑距离。分别用$P_n$和$C_n$表示$n$阶的路径图和$n$阶的循环图。设$C_{2n}^*$是具有对角线的圈图$C_{2n}$,$\widetilde{C_n}$是具有顶点集$\{v_0, v_1, \ldots, v_{n-1}\}$和$E(\widetilde{C_n})=E(C_n)\cup \{v_0v_2\}$的图. Marchant和Marchason确定了$C_6^{*}$的编辑距离函数。Peck研究了$C_n$的编辑距离函数,而Berikkyzy等人研究了循环幂的编辑距离。本文利用Peck和Martin的方法,分别确定了$C_8^{*}$、$\widetilde{C_n}$和$P_n$的编辑距离函数。

英文摘要:

The edit distance function of a hereditary property $\mathscr{H}$ is the asymptotically largest edit distance between a graph of density $p\in[0,1]$ and $\mathscr{H}$. Denote by $P_n$ and $C_n$ the path graph of order $n$ and the cycle graph of order $n$, respectively. Let $C_{2n}^*$ be the cycle graph $C_{2n}$ with a diagonal, and $\widetilde{C_n}$ be the graph with vertex set $\{v_0, v_1, \ldots, v_{n-1}\}$ and $E(\widetilde{C_n})=E(C_n)\cup \{v_0v_2\}$. Marchant and Thomason determined the edit distance function of $C_6^{*}$. Peck studied the edit distance function of $C_n$, while Berikkyzy et al. studied the edit distance of powers of cycles. In this paper, by using the methods of Peck and Martin, we determine the edit distance function of $C_8^{*}$, $\widetilde{C_n}$ and $P_n$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑