This paper advances the corona product to n times corona in the aspect of increasing and decreasing product of graphs and calibrates its energy and basic reproduction number. The proposed model emanates as a graph with successive generations of complexity, whose structure is constructed as a matrix based on its adjacency. The energy is measured from the sum of the absolute values of the eigen values of the adjacency matrix of graph G and the largest eigen value is known to be R0. The energy upper bound for increasing and decreasingn-corona product with order 1 of complete graphs are attained.