圈的互补棱柱中的码识别
Identifying Codes in the Complementary Prism of Cycles
摘要：
证明了在$n$阶循环的互补棱柱中的最小阶识别码具有$7n/9+Θ(1)$阶.此外，我们还观察到，一个图的互补棱镜宽度至多为$k$，并讨论了一些算法的结果。
英文摘要：
We show that an identifying code of minimum order in the complementary prism of a cycle of order $n$ has order $7n/9+Θ(1)$. Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width $k$ is at most $4k$, and discuss some algorithmic consequences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
