| dc.creator | Monsalve, Juan | es |
| dc.creator | Rada, Juan | es |
| dc.date | 2017-03-23 | |
| dc.date.accessioned | 2025-10-06T15:04:57Z | |
| dc.date.available | 2025-10-06T15:04:57Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1317 | |
| dc.identifier | 10.4067/S0716-09172016000400003 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255487 | |
| dc.description | The energy of a digraph is defined as E (D) =∑₁n|Re (zk)|, where z1,..., znare the eigenvalues of the adjacency matrix of D. This is a generalization of the concept of energy introduced by I. Gutman in 1978 [3]. When the characteristic polynomial of a digraph D is of the formwhere bo (D) = 1 and bk(D) ≥ 0 for all k, we show that This expression for the energy has many applications in the study of extremal values of the energy in special classes of digraphs. In this paper we consider the set D* (Cn) of all strongly connected digraphs whose underlying graph is the cycle Cn, and characterize those whose characteristic polynomial is ofthe form (0.1). As a consequence, we find the extremal values ofthe energy based on (0.2). | es |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | en |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1317/1029 | |
| dc.rights | Copyright (c) 2016 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 35 No. 4 (2016); 395-404 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 4 (2016); 395-404 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2016 | |
| dc.title | Energy of strongly connected digraphs whose underlying graph is a cycle | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
