OFFSET
1,3
COMMENTS
In general, consider a connected graph with E edges and V vertices. The vertices are given labels in the range 0 to E so that the differences between edges' endpoints are {1,...,E}. None of the vertices are isolated; hence each vertex label participates in at least one edge. For this sequence E = V = n.
LINKS
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Dec 01 2019, based on email from Don Knuth, Dec 01 2019
STATUS
approved