Levenshtein graphs: resolvability, automorphisms \& determining sets

DOI10.1016/j.disc.2022.113310OpenAlexW4316015021MaRDI QIDQ2689484

Manuel E. Lladser, Perrin E. Ruth

Publication date: 10 March 2023

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

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

zbMATH Keywords

node2vecHamming graphresolving setedit distancemultilaterationLevenshtein graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial codes (94B25)

Related Items (1)

Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications

Uses Software

• node2vec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation complexity of metric dimension problem
• Destroying automorphisms by fixing nodes
• Identifying graph automorphisms using determining sets
• Approximate matching of run-length compressed strings
• Edit distance of run-length encoded strings.
• Low-dimensional representation of genomic sequences
• On the metric dimension of Cartesian powers of a graph
• Landmarks in graphs
• Automorphisms group of generalized Hamming Graphs
• The determining number of a Cartesian product
• Algorithms for approximate string matching
• Biological Sequence Analysis
• The String-to-String Correction Problem
• Resolvability of Hamming Graphs
• The complexity of theorem-proving procedures
• Efficient reconstruction of sequences from their subsequences of supersequences

This page was built for publication: Levenshtein graphs: resolvability, automorphisms \& determining sets