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

Gómez Soto, José Manuel; Leaños, Jesús; Ríos Castro, Luis Manuel; Rivera Martínez, Luis Manuel

DSpace Principal
→
Doctorado en Ciencias Básicas
→
*Documentos Académicos*-- Doc. en Ciencias Básicas
→
Ver ítem

dc.contributor	132236	es_ES
dc.coverage.spatial	Global	es_ES
dc.creator	Gómez Soto, José Manuel
dc.creator	Leaños, Jesús
dc.creator	Ríos Castro, Luis Manuel
dc.creator	Rivera Martínez, Luis Manuel
dc.date.accessioned	2021-05-18T14:06:38Z
dc.date.available	2021-05-18T14:06:38Z
dc.date.issued	2018
dc.identifier	info:eu-repo/semantics/publishedVersion	es_ES
dc.identifier.issn	0166-218X	es_ES
dc.identifier.uri	http://ricaxcan.uaz.edu.mx/jspui/handle/20.500.11845/2488
dc.description.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.	es_ES
dc.language.iso	eng	es_ES
dc.publisher	Elsevier	es_ES
dc.relation	https://www.sciencedirect.com/science/article/abs/pii/S0166218X18301938	es_ES
dc.relation.uri	generalPublic	es_ES
dc.rights	Atribución-NoComercial-CompartirIgual 3.0 Estados Unidos de América	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/	*
dc.source	Discrete Applied Mathematics Vol. 247, pp. 327-340	es_ES
dc.subject.classification	CIENCIAS FISICO MATEMATICAS Y CIENCIAS DE LA TIERRA [1]	es_ES
dc.subject.other	Double vertex graph	es_ES
dc.subject.other	Packing number	es_ES
dc.subject.other	Error correcting codes	es_ES
dc.subject.other	Binary codes	es_ES
dc.title	The packing number of the double vertex graph of the path graph	es_ES
dc.type	info:eu-repo/semantics/article	es_ES