Locating vertices using codes
From MaRDI portal
Recommendations
- Possible cardinalities for locating-dominating codes in graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes and locating-dominating sets on paths and cycles
- On the size of identifying codes in binary hypercubes
Cited in
(9)- Upper bounds for binary identifying codes
- On regular and new types of codes for location-domination
- Covering codes of a graph associated with a finite vector space
- Locating-dominating codes in paths
- Locating-domination and identification
- Looking for vertex number one
- Possible cardinalities for locating-dominating codes in graphs
- On Iiro Honkala's contributions to identifying codes
- Identifying codes in vertex-transitive graphs and strongly regular graphs
This page was built for publication: Locating vertices using codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615964)
