On the packing number of $ 3 $-token graph of the path graph $ P_n $

On the packing number of $ 3 $-token graph of the path graph $ P_n $

In 2018, J. M. Gómez et al. showed that the problem of finding the packing number $ \rho(F_2(P_n)) $ of the 2-token graph $ F_2(P_n) $ of the path $ P_n $ of length $ n\ge 2 $ is equivalent to determining the maximum size of a binary code $ S' $ of constant weight $ w = 2 $ that can correct a s...

Full description

Bibliographic Details
Main Authors: Christophe Ndjatchi, Joel Alejandro Escareño Fernández, L. M. Ríos-Castro, Teodoro Ibarra-Pérez, Hans Christian Correa-Aguado, Hugo Pineda Martínez
Format: Article
Language:English
Published: AIMS Press 2024-03-01
Series:AIMS Mathematics
Subjects:
packing number
3-token graphs
error correcting codes
binary codes
algorithms
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2024571?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.2024571?viewType=HTML

Similar Items