Resolvability of Hamming Graphs

DOI10.1137/19M1274511zbMath1450.05019arXiv1907.05974OpenAlexW3092210544MaRDI QIDQ5128504

Richard C. Tillquist, Manuel E. Lladser, Lucas Laird, Stephen R. Becker

Publication date: 27 October 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeGröbner basisHamming graphHamming distanceinteger linear programminggraph embeddingresolving setmetric dimensionmultilaterationsymbolic data science

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Biochemistry, molecular biology (92C40) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

On vertices contained in all or in no metric basis ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric ⋮ Levenshtein graphs: resolvability, automorphisms \& determining sets ⋮ On metric dimensions of hypercubes

Uses Software

• SymPy
• Gurobi
• CVX
• OEIS
• F5C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best subset selection via a modern optimization lens
• The F5 algorithm in Buchberger's style
• Approximation complexity of metric dimension problem
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Resolvability in graphs and the metric dimension of a graph
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Low-dimensional representation of genomic sequences
• Resolving the hypercube
• Landmarks in graphs
• Multidimensional binary search trees used for associative searching
• Applied Linear Algebra
• Ideals, Varieties, and Algorithms
• The complexity of theorem-proving procedures
• A fast algorithm for particle simulations
• A modeling and computational study of the frustration index in signed networks

This page was built for publication: Resolvability of Hamming Graphs