Counting graceful labelings of trees: a theoretical and empirical study

DOI10.1016/J.DAM.2015.05.031zbMATH Open1327.05152OpenAlexW781498321MaRDI QIDQ897585FDOQ897585

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

Recommendations

• A survey of graceful trees
• scientific article; zbMATH DE number 1195746
• scientific article; zbMATH DE number 1990683
• Almost all trees are almost graceful
• Graceful labeling algorithms and complexity -- a survey

zbMATH Keywords

outlierPoisson distributionlinear regressionalgorithmdatabaseautomorphism groupubiquitously graceful

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Title not available (Why is that?)
• Modular gracious labellings of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On 0-rotatable graceful caterpillars
• On Graceful Labelings of Trees
• Gracefully labeled trees from Skolem sequences
• A note on the number of graceful labellings of paths
• On the asymptotic growth of bipartite graceful permutations
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: Counting graceful labelings of trees: a theoretical and empirical study

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