遇见数据集

On Extremal p-Energy of Bicyclic Digraphs

收藏
NIAID Data Ecosystem2026-03-13 收录
官方服务:

资源简介:

The p-energy of a k-vertex digraph D is defined by Ep(D)=∑j=1k|R(λj)I(λj)|, where λ1,…,λk are eigenvalues of D 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 p-energy.

创建时间:
2021-11-03
二维码
社区交流群
二维码
科研交流群
商业服务