construct/mc graceful graph
construct/mc graceful graph: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Let G be the graph with 10 vertices 0..9 made of 5 disjoint copies of the complete graph K 2 (copy g has vertices g 2, ..., g 2+1), where for each g < 4 and each i < 2 vertex g 2+i is also joined to vertex…
The task
Let G be the graph with 10 vertices 0..9 made of 5 disjoint copies of the complete graph K_2 (copy g has vertices g*2, ..., g*2+1), where for each g < 4 and each i < 2 vertex g*2+i is also joined to vertex (g+1)*2+i. G has 13 edges, in this order (index: edge): 0:(0,1), 1:(2,3), 2:(4,5), 3:(6,7), 4:(8,9), 5:(0,2),…