Bicyclic digraphs with maximal energy

Juan Monsalve and Juan Rada

Applied Mathematics and Computation, 2016, vol. 280, issue C, 124-131

Abstract: If D is a digraph with n vertices then the energy of D is defined as E(D)=∑k=1n|Re(zk)|, where Re (z1),…, Re(zn) are the real parts of the eigenvalues z1,…,zn 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 Bn with n vertices.

Keywords: Energy; Bicyclic digraphs; Extremal values (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316300376
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:280:y:2016:i:c:p:124-131

DOI: 10.1016/j.amc.2016.01.037

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 ().