On the asymptotic growth of bipartite graceful permutations

DOI10.1016/j.disc.2018.10.046zbMath1403.05006OpenAlexW2903276953WikidataQ128848818 ScholiaQ128848818MaRDI QIDQ1712524

M. A. Ollis, John McGill

Publication date: 22 January 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.046

zbMATH Keywords

graceful labelingHamiltonian decompositiontriangular embedding\(\alpha\)-labelingR-sequencing

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Uses Software

• OEIS

Cites Work

• Counting graceful labelings of trees: a theoretical and empirical study
• Spectra of digraphs
• A note on the number of graceful labellings of paths
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Triangular embeddings of complete graphs from graceful labellings of paths
• Sequenceable groups and related topics.
• Some Results on 1‐Rotational Hamiltonian Cycle Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item