An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbors within the code. We show a dichotomy for the size of the smallest identifying code in classes of graphs closed under induced subgraphs. Our dichotomy is d...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!