A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Abrham. J.. Graceful 2-regular graphs and Skolem sequences, Discrete Mathematics 93 (1991) 115-121. The purpose of the paper is to study relations graphs and certain Skolem sequences. between graceful numbering of certain 2-regular In this paper, all graphs will be finite, without loops or multiple edges. For any graph G, the symbols V(G) and E(G) will denote its vertex set and its edge set, respectively. A graceful numbering of a graph G with m vertices and n edges is a one-to-one mapping q ofdoi:10.1016/0012-365x(91)90247-y fatcat:o4l4ikoicjhbvmfmg344ja6soa