article
Open access
Identifying Codes in the Complementary Prism of Cycles
Research footprint
At a glance
- Citations
- 2
- References
- 21
- Comments
- 0
Paper overview
Abstract
We show that an identifying code of minimum order in the complementary prism of a cycle of order n has order 7 n/ 9 + Θ(1). Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width k is at most 4 k , and discuss some algorithmic consequences.
Record transparency
Publication details
- DOI
- 10.1016/j.entcs.2019.08.022
- OpenAlex
- W2241244069
- Document type
- article
- Language
- EN
- Source
- Electronic Notes in Theoretical Computer Science
- Last metadata update
Comments
Log in to join the discussion.