Please use this identifier to cite or link to this item: http://ricaxcan.uaz.edu.mx/jspui/handle/20.500.11845/2488
Full metadata record
DC FieldValueLanguage
dc.contributor132236es_ES
dc.coverage.spatialGlobales_ES
dc.creatorGómez Soto, José Manuel-
dc.creatorLeaños, Jesús-
dc.creatorRíos Castro, Luis Manuel-
dc.creatorRivera Martínez, Luis Manuel-
dc.date.accessioned2021-05-18T14:06:38Z-
dc.date.available2021-05-18T14:06:38Z-
dc.date.issued2018-
dc.identifierinfo:eu-repo/semantics/publishedVersiones_ES
dc.identifier.issn0166-218Xes_ES
dc.identifier.urihttp://ricaxcan.uaz.edu.mx/jspui/handle/20.500.11845/2488-
dc.description.abstractNeil Sloane showed that the problem of determining the maximum size of a binary code of constant weight 2 that can correct a single adjacent transposition is equivalent to finding the packing number of a certain graph. In this paper we solve this open problem by finding the packing number of the double vertex graph of the path graph. This double vertex graph is isomorphic to Sloane’s graph. Our solution implies a conjecture of Rob Pratt about the ordinary generating function of sequence A085680.es_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.relationhttps://www.sciencedirect.com/science/article/abs/pii/S0166218X18301938es_ES
dc.relation.urigeneralPublices_ES
dc.rightsAtribución-NoComercial-CompartirIgual 3.0 Estados Unidos de América*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.sourceDiscrete Applied Mathematics Vol. 247, pp. 327-340es_ES
dc.subject.classificationCIENCIAS FISICO MATEMATICAS Y CIENCIAS DE LA TIERRA [1]es_ES
dc.subject.otherDouble vertex graphes_ES
dc.subject.otherPacking numberes_ES
dc.subject.otherError correcting codeses_ES
dc.subject.otherBinary codeses_ES
dc.titleThe packing number of the double vertex graph of the path graphes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
Appears in Collections:*Documentos Académicos*-- Doc. en Ciencias Básicas

Files in This Item:
File Description SizeFormat 
the-packing-number.pdfManuscrito del artículo714,32 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons