Minimum covering seidel laplacian energy of a graph

The graph energy was defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of the graph in 1978. Variants of graph energy have been defined by considering various matrix representations of the graph instead of the adjacency matrix, which is the graph's most basic matrix. Determining bounds for graph energy variants and energy calculations of certain graphs are current topics in the literature. In this study, first of all, the minimum covering Seidel Laplacian matrix of a simple graph Gis introduced depending on the minimum covering set. Then, by calculating the trace of this matrix, the minimum covering Seidel Laplacian energy of the graph is defined. Moreover, some bounds for the minimum covering Seidel Laplacian energy of the graph depending on various graph parameters are obtained.