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

DOI10.1016/j.dam.2018.03.085zbMath1394.05101arXiv1711.03682OpenAlexW2795616423MaRDI QIDQ1671357

J. M. Gómez Soto, L. M. Ríos-Castro, Luis Manuel Rivera, Jesús Leaños

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.03682

zbMATH Keywords

binary codespacking numbererror correcting codesdouble vertex graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60) Synchronization error-correcting codes (94B50)

Related Items (8)

Edge-transitive token graphs ⋮ On the Connectivity of Token Graphs of Trees ⋮ Automorphism group of 2-token graph of the Hamming graph ⋮ The automorphism groups of some token graphs ⋮ Spectral properties of token graphs ⋮ Independence and matching numbers of some token graphs ⋮ A genetic algorithm for the maximum 2-packing set problem ⋮ The edge-connectivity of token graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of reconfiguration problems
• Symmetric squares of graphs
• Survey of double vertex graphs
• Token graphs
• Swapping labeled tokens on graphs
• Regularity and planarity of token graphs
• Non-isomorphic graphs with cospectral symmetric powers
• The connectivity of token graphs
• The complexity of change
• Estimating the size of correcting codes using extremal graph problems
• Hamiltonicity of token graphs of fan graphs
• Reconfigurations in Graphs and Grids

This page was built for publication: The packing number of the double vertex graph of the path graph