arXiv (All)
open access
On the Vertices That Belong to All Minimum Identifying Codes
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in every minimum identifying code in a graph. There are two types of such vertices: \emph{always-forced} vertices that belong
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Hamming distance properties of group codes#490073
- Infinite families of 3-designs from linear and nonlinear codes#1109523
- Perfect Combinatorial Structures in Coding Theory and Cryptography#1069934
- Distinguishers for Skew and Linearized Reed-Solomon Codes#13008
- Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets#1142860
Record · ID 996668
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive