Bicyclic digraphs with maximal energy
作者：
Highlights：
•
摘要
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.
论文关键词：Energy,Bicyclic digraphs,Extremal values
论文评审过程：Received 18 December 2015, Revised 12 January 2016, Accepted 16 January 2016, Available online 10 February 2016, Version of Record 10 February 2016.
论文官网地址：https://doi.org/10.1016/j.amc.2016.01.037
