2015/06/17 by Susana-Clara López, López, S. C., Francesc-Antoni Muntaner-Batle +1
Computer Science · Engineering · #05C78 #11B99 #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1506.05386
openalex publication_date 2015/06/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each labeled from d up to d+m-1 appears twice and in which the vertices that have been label with k are at distance k. In this paper, we introduce two generalizations of this labeling that are related to distances.