遇见数据集

On Extremal p-Energy of Bicyclic Digraphs

收藏
DataCite Commons2023-02-23 更新2024-07-28 收录
官方服务:

资源简介:

The <i>p</i>-energy of a <i>k</i>-vertex digraph <i>D</i> is defined by Ep(D)=∑j=1k|R(λj)I(λj)|, where λ1,…,λk are eigenvalues of <i>D</i> and R(λj) and I(λj) are respectively real and imaginary parts of the eigenvalue λj. In the present paper, we consider a class of bicyclic digraphs such that each digraph in this class contains two vertex-disjoint directed cycles. We find digraphs in this class with extremal <i>p</i>-energy.

提供机构:
Taylor & Francis
创建时间:
2021-11-03
二维码
社区交流群
二维码
科研交流群
商业服务