Counting graceful labelings of trees: a theoretical and empirical study

DOI10.1016/j.dam.2015.05.031zbMath1327.05152OpenAlexW781498321MaRDI QIDQ897585

David J. Anick

Publication date: 7 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.031

zbMATH Keywords

algorithmdatabaseautomorphism groupPoisson distributionlinear regressionoutlierubiquitously graceful

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

On 0-rotatable graceful caterpillars ⋮ On the asymptotic growth of bipartite graceful permutations

Uses Software

• OEIS

Cites Work

• New asymptotic expansion for the gamma function
• Poisson convergence and Poisson processes with applications to random graphs
• The distribution of degrees in a large random tree
• The factorial representation of balanced labelled graphs
• 0-centred and 0-ubiquitously graceful trees.
• Operations of interlaced trees and graceful trees
• A note on the number of graceful labellings of paths
• Rook polynomials on two-dimensional surfaces and graceful labellings of graphs
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• The number of trees
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Combinatorics of rooted trees and Hopf algebras
• Infinitely many equivalent versions of the graceful tree conjecture
• All trees of diameter five are graceful
• Ordered graceful labellings of the 2-star
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item