Please use this identifier to cite or link to this item:
Title: The packing number of the double vertex graph of the path graph
Authors: 132236
Issue Date: 2018
Publisher: Elsevier
Abstract: Neil 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.
ISSN: 0166-218X
Other Identifiers: info:eu-repo/semantics/publishedVersion
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