scientific article; zbMATH DE number 3867369
Additive versions of graceful graphs have been defined and studied under the name harmonious graphs. Recently exact modular additive analogue versions of graceful graphs have been studied under the name elegant graphs. This paper settles the problem of elegant labeling of paths. Let \(Z_ n\) be the additive group of integers modulo n and let \(P_ n\) denote the path on n vertices. The path \(P_ n\) is said to be elegant if it is possible to label the vertices of \(P_ n\) with distinct elements of \(Z_ n\) so that on labeling the edges with the sums of their endpoint labels, these edge labels are distinct and range over \(Z_ n-\{0\}.\) The author proves that the path \(P_ n\) of order n is elegant for all values of n except for \(n=4.\) It should be remarked that in Figure 1(a) the author has assigned \(2k+1\) vertices instead of \(2k-1.\) This can be corrected by deleting the vertices 2k and \(2k-1\) and adding the edge joining the vertices 0 and \(2k-3\). Also, in the title of Figure 1(c), the path \(P_{84k}\) should be \(P_{4k}\).
- scientific article; zbMATH DE number 512818
- scientific article; zbMATH DE number 568796
- scientific article; zbMATH DE number 2097026
- On the extremal values of ratios of number of paths
- Graceful labellings of paths
- A simple approach to nondecreasing paths
- A path analogue of the Oberwolfach problem
- Paths on polymatroids
- scientific article; zbMATH DE number 3104851
- On tractability of path integration
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335813)