On the ordering of bicyclic digraphs with respect to energy and iota energy

Xiuwen Yang and Ligong Wang

Applied Mathematics and Computation, 2018, vol. 339, issue C, 768-778

Abstract: Let z1,z2,…,zn be eigenvalues of the adjacency matrix of an n-vertex digraph D. Let Re(zk) and Im(zk) denote the real part and the imaginary part of eigenvalue zk, respectively. The energy of an n-vertex digraph D is defined as E(D)=∑k=1n|Re(zk)|. Recently, the concept of energy of digraphs is extended to iota energy of digraphs. The iota energy of an n-vertex digraph D is defined as Ec(D)=∑k=1n|Im(zk)|. In this paper, we investigate the energy and iota energy about a class Dn of n-vertex bicyclic digraphs with vertex-disjoint two directed even cycles and characterize the digraphs in Dn with maximal and minimal energy or iota energy. Moreover, we determine the whole ordering in Dn with respect to energy and iota energy, respectively.

Keywords: Energy of digraphs; Iota energy of digraphs; Bicyclic digraphs (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318306337
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:339:y:2018:i:c:p:768-778

DOI: 10.1016/j.amc.2018.07.067

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().