Identifying Codes in the Complementary Prism of Cycles

Electronic Notes in Theoretical Computer Science(2019)

引用 0|浏览21
暂无评分
摘要
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.
更多
查看译文
关键词
identifying code,complementary prism,dominating set,cycle
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要