Distance labelings: a generalization of Langford sequences

DOI10.26493/1855-3974.896.FBFMaRDI QIDQ5357301zbMATH OpenOpenAlexWikidataFDO

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

Publication date 14 September 2017

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

\(\delta\)-sequence\(\delta\)-setdistance J-labelingdistance l-labelingLangford sequence

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Other combinatorial number theory (11B75)

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.

Recommendations

• Extended Langford sequences with small defects
• scientific article; zbMATH DE number 1185300
• scientific article; zbMATH DE number 1409224
• A survey on labeling graphs with a condition at distance two
• Labeling graphs with two distance constraints

Cited in

(1)

• On island sequences of labelings with a condition at distance two

This page was built for publication: Distance labelings: a generalization of Langford sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357301)