共 50 条
Bicyclic digraphs with maximal energy
被引:18
作者:
Monsalve, Juan
[1
]
Rada, Juan
[1
]
机构:
[1] Univ Antioquia Medellin, Inst Matemat, Medellin, Colombia
关键词:
Energy;
Bicyclic digraphs;
Extremal values;
SPECTRAL-RADIUS;
D O I:
10.1016/j.amc.2016.01.037
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
If D is a digraph with n vertices then the energy of D is defined as epsilon(D) = Sigma(n)(k=1) vertical bar Re(z(k))vertical bar, where Re (z(1)), ..., Re(z(n)) 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. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:124 / 131
页数:8
相关论文
共 50 条