Distance labelings: a generalization of Langford sequences

S. C. López; F. A. Muntaner-Batle

Distance labelings: a generalization of Langford sequences

Combinatorics 2015-06-18 v1

Authors: S. C. López , F. A. Muntaner-Batle

Abstract

A Langford sequence of order $m$ and defect $d$ can be identified with a labeling of the vertices of a path of order $2m$ in which each labeled from $d$ up to $d+m-1$ appears twice and in which the vertices that have been label with $k$ are at distance $k$ . In this paper, we introduce two generalizations of this labeling that are related to distances.

Keywords

distance labelings Langford sequences graph labeling paths combinatorics vertex distance generalization

Cite

@article{arxiv.1506.05386,
  title  = {Distance labelings: a generalization of Langford sequences},
  author = {S. C. López and F. A. Muntaner-Batle},
  journal= {arXiv preprint arXiv:1506.05386},
  year   = {2015}
}

Comments

9 pages, 5 figures

Related papers

View all related →