Identifying Codes in the Complementary Prism of Cycles

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 2019-08-30 DOI:10.1016/j.entcs.2019.08.022

Márcia R. Cappelle , Erika M.M. Coelho , Hebert Coelho , Lucia D. Penso, Dieter Rautenbach

引用次数: 3

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

互补环棱镜中的识别码

我们证明了在n阶循环的互补棱镜中最小阶的识别码的阶为7n/9 + Θ(1)。此外，我们观察到团宽度为k的图的互补棱镜的团宽度最多为4k，并讨论了一些算法结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs