✦ LIBER ✦

Path-sequential labellings of cycles

✍ Scribed by Jeffrey M. Vanderkam

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 508 KB
Volume: 162
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00289-9

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate labelling the vertices of the cycle of length n with the integers 0, ..., n -1 in such a way that the n sums of k adjacent integers are sequential. We show that this is impossible for both n and k even, possible for n even and k odd, and that it is possible for many cases where n is odd. We conjecture that it is always possible when n is odd.

📜 SIMILAR VOLUMES

Relating path coverings to vertex labell

Relating path coverings to vertex labellings with a condition at distance two

✍ John P. Georges; David W. Mauro; Marshall A. Whittlesey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A blabelling of graph G is an integer labelling of V(G) such that adjacent vertices have labels that differ by at least two and vertices distance two apart have labels that differ by at least one. The 1 number of G, I(G), is the minimum span of labels over all such labellings. Griggs and Yeh have st

On prime labellings

✍ Hung-Lin Fu; Kuo-Ching Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 347 KB

IS called a prime labelling if for each e = {u, u} in E, we have GCD(f(u),f(u))= 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conject

On sequential labelings of graphs

✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

Equitable labelings of cycles

✍ Jerzy Wojciechowski 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

## Abstract Every labeling of the vertices of a graph with distinct natural numbers induces a natural labeling of its edges: the label of an edge (__x, y__) is the absolute value of the difference of the labels of __x__ and __y.__ By analogy with graceful labelings, we say that a labeling of the ve

Closures, cycles, and paths

✍ Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract In 1960 Ore proved the following theorem: Let __G__ be a graph of order __n__. If __d__(__u__) + __d__(__v__)≥__n__ for every pair of nonadjacent vertices __u__ and __v__, then __G__ is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have

Paths extendable to cycles

✍ T. D. Parsons 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Let __k__ be a positive integer, and __S__ a nonempty set of positive integers. Suppose that __G__ is a connected graph containing a path of length __k__, and that each path __P__ of length __k__ in __G__ is contained in some cycle __C__(__P__) of length s ∈ __S__. We prove that every p