Abstract
If D is a digraph with n vertices then the energy of D is defined as E(D)=∑k=1n|Re(zk)|, where Re (z1),…, Re(zn) are the real parts of the eigenvalues z1,…,zn of D. In this paper we solve a problem proposed in Khan et al. (2015), we find the maximal value of the energy over the set of all bicyclic digraphs Bn with n vertices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
