id: 03926944
dt: j
an: 03926944
au: Bloom, G.S.; Hsu, D.F.
ti: On graceful directed graphs.
so: SIAM J. Algebraic Discrete Methods 6, 519-536 (1985).
py: 1985
pu: Society for Industrial and Applied Mathematics, Philadelphia, PA
la: EN
cc: 
ut: graceful directed graphs; graceful numbering; graph numberings
ci: 
li: doi:10.1137/0606051
ab: This very interesting paper introduces the concept of graceful directed
    graphs as follows. A digraph D with e arcs is numbered by assigning a
    distinct integer value h(v) from $\{$ 0,1,...,e$\}$ to each node v.
    Each arc (u,v) receives a value $h(u,v)=h(v)-h(u)$ (mod e$+1)$. If the
    arc values are all distinct and nonzero, then the numbering h is
    graceful, and a digraph is graceful if it has a graceful numbering.
    Properties and examples of this new class of graph numberings are
    presented. Applications of various algebraic structures for generating
    graceful digraphs are made. Some fundamental questions and conjectures
    are presented.
rv: P.Slater