Title

The packing number of the double vertex graph of the path graph

Author

LUIS MANUEL RIVERA MARTINEZ

Access level

Open Access

Summary or description

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.

Producción Científica de la Universidad Autónoma de Zacatecas UAZ

Publish date

2018

Publication type

Article

Format

application/pdf

Language

English

Audience

General public

Source repository

Repositorio Institucional Caxcán

Downloads

0

Comments



You need to sign in or sign up to comment.