On path-sequential labellings of cycles

DOI10.1016/S0012-365X(99)00226-5MaRDI QIDQ1974517zbMATH OpenOpenAlexFDO

Authors Ron A. Fertig

Publication date 18 October 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00226-5

zbMATH Keywords

cyclesgraph labellingpath-sequential labelling

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Consider a labelling of the vertices of the cycle \(C_n\) by the integers \(0, 1, \ldots, n-1\), each vertex obtaining a distinct label. Such a labelling is called \(k\)-sequential, when the \(n\) sums of \(k\) adjacent labels form a set of consecutive integers. Vanderkam has conjectured that there is a \(k\)-sequential labelling of \(C_n\), if and only if \(n\) is odd, or \(k\) is odd. This paper shows that a \(k\)-sequential labelling of \(C_{mn}\) can be obtained from a \(k\)-sequential labelling of \(C_m\). This reduces the number of cases to check the conjecture considerably.

Recommendations

• Path-sequential labellings of cycles
• Path-sequential graphs
• scientific article; zbMATH DE number 1960972
• Path-sequential graphs

Cited in

(3)

• Path-sequential labellings of cycles
• scientific article; zbMATH DE number 434698 (Why is no real title available?)
• scientific article; zbMATH DE number 1960972 (Why is no real title available?)

This page was built for publication: On path-sequential labellings of cycles

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