Edgeless graphs are 1-colourable graphs and this is because if it has more 0 edge then we have to use two colors or more according to coloring of graphs.
Given a graph and a source node and destination node, find the number of shortest paths present between source and destination?
