  We describe symbolic constructions for listing and enumerating graphs having
the same induced edge label sequence. We settle in the affirmative R. Whitty's
[W08] conjectured existence of determinantal constructions for listing and
enumerating gracefully labeled trees. We conclude the paper with a description
of a new graceful labeling algorithm.
