The minimum covering energy of a simple graph G is the sum of the absolute values of the eigenvalues of its minimum covering adjacency matrix Ac(G). This study investigates the minimum covering energy of standard graphs including complete graph, star graph, crown graph, complete bipartite graph, and cocktail graph using SCILAB programming. The Minimum covering energy is a critical parameter in network optimization, representing the minimum energy required to cover all edges. In this paper, we have newly constructed five different SCILAB programs for minimum covering energy of simple graph of order n using SCILAB version 6.0.1. The algorithm is tested on standard graphs with varying sizes, and the results demonstrate the approach's effectiveness. The minimum covering energy of a graph increases with graph size.
