  In this paper, we present two new matrices, namely the resistance Laplacian
and resistance signless Laplacian matrix of a connected graph. We provide a
generalized form of these matrices for different classes of graphs, including
the complete graph, complete bipartite graph, and cycle. We investigate the
spectral properties of these matrices, analyzing their eigenvalues and
eigenvectors. Moreover, we introduce a concept similar to graph energy and
define it as the resistance Laplacian energy of a graph and further discuss
some bounds for this energy.
