Abstract | ||
---|---|---|
If D is a digraph with n vertices then the energy of D is defined as E ( D ) = ¿ k = 1 n | Re ( z k ) | , where Re ( z 1 ) , ¿ , Re(zn) are the real parts of the eigenvalues z 1 , ¿ , z n 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 B n with n vertices. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1016/j.amc.2016.01.037 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Energy,Bicyclic digraphs,Extremal values | Combinatorics,Vertex (geometry),Bicyclic molecule,Mathematics,Digraph,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
280 | C | 0096-3003 |
Citations | PageRank | References |
3 | 0.63 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Juan Monsalve | 1 | 3 | 0.63 |
Juan Rada | 2 | 36 | 10.02 |