Resolving sets and split resolving sets of symmetric designs
From MaRDI portal
Cites work
- Base size, metric dimension and other invariants of groups and graphs
- Combinatorics of symmetric designs
- Extremal combinatorics. With applications in computer science
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 7283893 (Why is no real title available?)
- Linear nonbinary covering codes and saturating sets in projective spaces
- Lines in higgledy-piggledy arrangement
- Metric dimension and metric independence number of incidence graphs of symmetric designs
- On the metric dimension of imprimitive distance-regular graphs
- On the metric dimension of incidence graphs
- Resolvability in graphs and the metric dimension of a graph
- Resolving sets and semi-resolving sets in finite projective planes
- Resolving sets for higher dimensional projective spaces
- Search problems in vector spaces
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
This page was built for publication: Resolving sets and split resolving sets of symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864196)