Identifying codes in the complementary prism of cycles

DOI10.1016/j.entcs.2019.08.022OpenAlexW2979042171WikidataQ113317410 ScholiaQ113317410MaRDI QIDQ2132351

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

Publication date: 27 April 2022

Full work available at URL: https://arxiv.org/abs/1507.05083

zbMATH Keywords

cycledominating setidentifying codecomplementary prism

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal lower bound for 2-identifying codes in the hexagonal grid
• Identifying codes in some subgraphs of the square lattice
• Minimal identifying codes in trees and planar graphs with large girth
• Identifying codes of Cartesian product of two cliques of the same size
• New bounds for codes identifying vertices in graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Lower bounds for identifying codes in some infinite grids
• Linear time solvable optimization problems on graphs of bounded clique-width
• Identifying codes of cycles
• A linear algorithm for minimum 1-identifying codes in oriented trees
• The relative clique-width of a graph
• On a new class of codes for identifying vertices in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

This page was built for publication: Identifying codes in the complementary prism of cycles