Resolvent Energy of Digraphs
نویسندگان
1 Department of Mathematics, Qom, Iran
2 Department of Mathematics, Qom, Iran
doi
10.22052/ijmc.2021.242877.1562چکیده
In this paper, we present two approaches to compute the resolvent energy of a digraph . The first method computes the energy by ER(G)=\sum_{i=1})^n\frac{1}{n-Re(z_i)}, where Re(z_i )denotes the real part of the eigenvalue z_i of G. In the second method we define ER(G)=\sum_{i=1}^n\frac{1}{n-σ_i}, where σ_i is the ith singular value of G. We prove some properties of resolvent energy for some special digraphs and determine the resolvent energy of unicyclic and bicyclic digraphs and present lower bound for resolvent energy of directed cycles.