Identifying Codes in the Complementary Prism of Cycles
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.