A graph is called regularable if it is possible to label its edges with integers so that the sum of the integers assigned to the edges incident to the vertices are all same, say equal to . Clearly if the given graph is regular of degree then there is no need to find an edge-assignment; simply...