Identifying Codes in the Complementary Prism of Cycles

preprint2015arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Identifying Codes in the Complementary Prism of Cycles

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0