Identifying Codes in the Complementary Prism of Cycles
Combinatorics
2015-07-20 v1
Abstract
We show that an identifying code of minimum order in the complementary prism of a cycle of order has order . Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width is at most , and discuss some algorithmic consequences.
Cite
@article{arxiv.1507.05083,
title = {Identifying Codes in the Complementary Prism of Cycles},
author = {Marcia R. Cappelle and Erika M. M. Coelho and Hebert Coelho and Lucia D. Penso and Dieter Rautenbach},
journal= {arXiv preprint arXiv:1507.05083},
year = {2015}
}